Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
عنوان مقاله: Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
شناسه ملی مقاله: JR_JCR-7-1_006
منتشر شده در شماره 1 دوره 7 فصل Winter and Spring در سال 1394
شناسه ملی مقاله: JR_JCR-7-1_006
منتشر شده در شماره 1 دوره 7 فصل Winter and Spring در سال 1394
مشخصات نویسندگان مقاله:
Rasool Azimi - Faculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Hedieh Sajedi - Department of Computer Science, College of Science, University of Tehran, Tehran, Iran
خلاصه مقاله:
Rasool Azimi - Faculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Hedieh Sajedi - Department of Computer Science, College of Science, University of Tehran, Tehran, Iran
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K-Means, which alters the convergence method of K-Means algorithm to provide more accurate clustering results than the K-means algorithm and its variants by increasing the clusters’ coherence. Persistent K-Means uses an iterative approach to discover the best result for consecutive iterations of KMeans algorithm.
کلمات کلیدی: Data mining, clustering, K-means, Persistent K-Means
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/682953/