Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
محورهای موضوعی : Journal of Computer & Robotics
Rasool Azimi
1
(Faculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran)
Hedieh Sajedi
2
(Department of Computer Science, College of Science, University of Tehran, Tehran, Iran)
کلید واژه: Data mining, Clustering, K-means, Persistent K-Means,
چکیده مقاله :
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 K-Means algorithm.
