![](/images/graphics-bg.png)
Self-Adaptive K-Means Based on a Covering Algorithm
المؤلفون المشاركون
Yang, Yun
Liu, Xiao
Zhang, Yiwen
Zhou, Yuanyuan
Guo, Xing
Wu, Jintao
He, Qiang
المصدر
العدد
المجلد 2018، العدد 2018 (31 ديسمبر/كانون الأول 2018)، ص ص. 1-16، 16ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2018-08-01
دولة النشر
مصر
عدد الصفحات
16
التخصصات الرئيسية
الملخص EN
The K-means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time.
However, the value of the clustering number k in the K-means algorithm is not always easy to be determined, and the selection of the initial centers is vulnerable to outliers.
This paper proposes an improved K-means clustering algorithm called the covering K-means algorithm (C-K-means).
The C-K-means algorithm can not only acquire efficient and accurate clustering results but also self-adaptively provide a reasonable numbers of clusters based on the data features.
It includes two phases: the initialization of the covering algorithm (CA) and the Lloyd iteration of the K-means.
The first phase executes the CA.
CA self-organizes and recognizes the number of clusters k based on the similarities in the data, and it requires neither the number of clusters to be prespecified nor the initial centers to be manually selected.
Therefore, it has a “blind” feature, that is, k is not preselected.
The second phase performs the Lloyd iteration based on the results of the first phase.
The C-K-means algorithm combines the advantages of CA and K-means.
Experiments are carried out on the Spark platform, and the results verify the good scalability of the C-K-means algorithm.
This algorithm can effectively solve the problem of large-scale data clustering.
Extensive experiments on real data sets show that the accuracy and efficiency of the C-K-means algorithm outperforms the existing algorithms under both sequential and parallel conditions.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Zhang, Yiwen& Zhou, Yuanyuan& Guo, Xing& Wu, Jintao& He, Qiang& Liu, Xiao…[et al.]. 2018. Self-Adaptive K-Means Based on a Covering Algorithm. Complexity،Vol. 2018, no. 2018, pp.1-16.
https://search.emarefa.net/detail/BIM-1135921
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Zhang, Yiwen…[et al.]. Self-Adaptive K-Means Based on a Covering Algorithm. Complexity No. 2018 (2018), pp.1-16.
https://search.emarefa.net/detail/BIM-1135921
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Zhang, Yiwen& Zhou, Yuanyuan& Guo, Xing& Wu, Jintao& He, Qiang& Liu, Xiao…[et al.]. Self-Adaptive K-Means Based on a Covering Algorithm. Complexity. 2018. Vol. 2018, no. 2018, pp.1-16.
https://search.emarefa.net/detail/BIM-1135921
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1135921
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
![](/images/ebook-kashef.png)
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر
![](/images/kashef-image.png)