DocumentCode :
2160391
Title :
Improved K-Means Clustering Algorithm
Author :
Zhang, Zhe ; Zhang, Junxi ; Xue, Huifeng
Volume :
5
fYear :
2008
fDate :
27-30 May 2008
Firstpage :
169
Lastpage :
172
Abstract :
K-means algorithm is widely used in spatial clustering. It takes the mean value of each cluster centroid as the Heuristic information, so it has some disadvantages:  sensitive to the initial centroid and instability. The improved clustering algorithm referred to the best clustering centriod which is searched during the optimization of clustering centroid. That increased the searching probability around the best centroid and improved the stability of the algorithm. The experiment on two groups of representative dataset proved that the improved K-means algorithm performs better in global searching and is less sensitive to the initial centroid.
Keywords :
Automation; Clustering algorithms; Data mining; Educational institutions; Gradient methods; Multidimensional signal processing; Neural networks; Partitioning algorithms; Signal processing algorithms; Stability; Data mining; K-means; centroid; cluster; clustering; spatial clustering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image and Signal Processing, 2008. CISP '08. Congress on
Conference_Location :
Sanya, China
Print_ISBN :
978-0-7695-3119-9
Type :
conf
DOI :
10.1109/CISP.2008.350
Filename :
4566809
Link To Document :
بازگشت