K-Means Optimization Algorithms of Initial Clustering Center Based on Regional Density

Article Preview

Abstract:

The accuracy of K-means algorithm is greatly influenced by initial clustering center which is related to the density distribution of the sample to some extent. In order to obtain the gradually optimized initial clustering center, the present study implement the loop fusion of sub regions based on their density and correlation by dividing the region into sub ones. The improved K-means algorithm is tested in two dimensions, and the results show that the improved algorithm obtains more optimized initial clustering center with higher accuracy of clustering.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

478-482

Citation:

Online since:

February 2014

Keywords:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Tou J. Pattern Recognition Principles. Reading, USA: Addison Wesley, (1974).

Google Scholar

[2] Linde Y, Buzo A, Gary R. An Algorithm for Vector Quantizer Design. IEEE Trans on Communication, Vol. 28, No 1, 1980, pp.84-95.

DOI: 10.1109/tcom.1980.1094577

Google Scholar

[3] Chomicki J, Godfrey P, Gryz J, et al. Skyling with presorting: Theory and Optimization; Proc of the International Conference on Intelligent Information Systems. Wroclaw, Poland, 2005: p.216.

Google Scholar

[4] KAUFMAN L. ROUSSEEUW P J. Finding groups in data: an introduction to cluster analysis[M]. New Youk: Wileys, (1990).

Google Scholar

[5] DHILLON I S, Guan Yu-qiang, KOGAN J. Refining clusters in high dimensional text data [C] ; Proc of the 2nd SIAM Workshop on Clustering High Dimensional Data, 2002: p.59.

DOI: 10.1109/icdm.2002.1183895

Google Scholar

[6] LAI Yu-xia, LIU Jian-ping. Optimization study on initial center of K-means algorithm. Computer Engineering and Applications, Vol. 44, No 10, 2008, pp.147-149.

Google Scholar

[7] WANG Zhong, LIU Gui-quan. CHEN En-hong. A K-means Algorithm Based on Optimized Initial Center Points. Pattern Recognition and Artificial Intelligence, Vol. 22, No 2, 2009, pp.299-304.

Google Scholar

[8] WANG Sabfang, DAI Fang, WANG Wan-bin, ZHANG Xiao-yu. A K-Means Algorithm Based on the Optimal Initial Clustering Center. Computer Engineering and Science, Vol. 32, No 10, 2010, pp.105-116.

Google Scholar

[9] HAN Ling-bo, WANG Qiang, JIANG Zheng-feng, HAO Zhi-qiang. Improved k-means initial clustering center selection algorithm. Computer Engineering and Applications, Vol. 46, No 17, 2010, pp.150-152.

Google Scholar