288 pp. per issue
6 x 9, illustrated
2014 Impact factor:

Neural Computation

November 2017, Vol. 29, No. 11, Pages 3094-3117
(doi: 10.1162/neco_a_01014)
© 2017 Massachusetts Institute of Technology
An Initialization Method Based on Hybrid Distance for k-Means Algorithm
Article PDF (517.09 KB)

The traditional -means algorithm has been widely used as a simple and efficient clustering method. However, the performance of this algorithm is highly dependent on the selection of initial cluster centers. Therefore, the method adopted for choosing initial cluster centers is extremely important. In this letter, we redefine the density of points according to the number of its neighbors, as well as the distance between points and their neighbors. In addition, we define a new distance measure that considers both Euclidean distance and density. Based on that, we propose an algorithm for selecting initial cluster centers that can dynamically adjust the weighting parameter. Furthermore, we propose a new internal clustering validation measure, the clustering validation index based on the neighbors (CVN), which can be exploited to select the optimal result among multiple clustering results. Experimental results show that the proposed algorithm outperforms existing initialization methods on real-world data sets and demonstrates the adaptability of the proposed algorithm to data sets with various characteristics.