Selection algorithm for K-means initial clustering center
ZHENG Dan1,2,WANG Qian-ping2
1. Department of Personnel, Jiangsu Normal University, Xuzhou Jiangsu 221116, China 2. School of Computer Science and Technology, China University of Mining and Technology, Xuzhou Jiangsu 221116,China
Abstract：The initial clustering centers of K-means algorithm are randomly selected, which may result in low accuracy and unstable clustering. To solve these problems, a K-means initial clustering center selection algorithm was proposed. The locations of data points were determined by analyzing Difference of K-dist (DK) graph. One point with the least k-dist value on the main density curves was selected as an initial clustering center. The experimental results demonstrate that the improved algorithm can select unique initial clustering center, gain stable clustering result, get higher accuracy and reduce times of iteration.
ESTER M, KRIEGEL H-P, SANDER J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise [C]// KDD-96: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining. Menlo Park: AAAI Press, 1996: 226-231.
2012, Vol. 32 
