A review of the improved K-Means Clustering Algorithms for big data
Publish place: 7th International Conference on Science & Technology with sustainable development approach
Publish Year: 1401
نوع سند: مقاله کنفرانسی
زبان: English
View: 165
This Paper With 11 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
TECHSD07_012
تاریخ نمایه سازی: 17 خرداد 1402
Abstract:
This paper has a review of the improved K-Means clustering algorithms, which improve the shortcomings of the K-Means algorithm and thus provide a better and more efficient algorithm for learning big data. The goal is to cluster several large data sets, while maintaining the simplicity and efficiency of K-Means. All of these methods upgrade the standard K-Means algorithm to an efficient algorithm for big data.
Keywords:
K-Means , Clustering , Improvement of K-Means algorithm , Big data , Quality of Clustering , Execution time , initialization , classification
Authors
Fatemeh Moodi
Ph.D, Student, Yazd University, Yazd, Iran
Amir Jahangard-Rafsanjani
Assistant Professor Yazd University, Yazd, Iran
Sajjad Zarifzadeh
Associate Professor Yazd University, Yazd, Iran
Hamid Saadatfar
Assistant Professor, Birjand University, South Of Khorasan, Birjand, Iran