DocumentCode
2195671
Title
Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm
Author
Na, Shi ; Xumin, Liu ; Yong, Guan
Author_Institution
Coll. of Inf. Eng., Capital Normal Univ. CNU, Beijing, China
fYear
2010
fDate
2-4 April 2010
Firstpage
63
Lastpage
67
Abstract
Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the k-means clustering algorithm has to calculate the distance between each data object and all cluster centers in each iteration, which makes the efficiency of clustering is not high. This paper proposes an improved k-means algorithm in order to solve this question, requiring a simple data structure to store some information in every iteration, which is to be used in the next interation. The improved method avoids computing the distance of each data object to the cluster centers repeatly, saving the running time. Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means.
Keywords
data mining; pattern clustering; cluster centers; clustering analysis method; data mining; data object; k-means clustering algorithm; Algorithm design and analysis; Clustering algorithms; Computational complexity; Data engineering; Data mining; Educational institutions; Information analysis; Iterative algorithms; Machine learning; Partitioning algorithms; clustering analysis; computational complexity; distance; k-means algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Information Technology and Security Informatics (IITSI), 2010 Third International Symposium on
Conference_Location
Jinggangshan
Print_ISBN
978-1-4244-6730-3
Electronic_ISBN
978-1-4244-6743-3
Type
conf
DOI
10.1109/IITSI.2010.74
Filename
5453745
Link To Document