Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
535140 | Pattern Recognition Letters | 2008 | 9 Pages |
Abstract
A hierarchical initialization approach is proposed to the K-Means clustering problem. The core of the proposed method is to treat the clustering problem as a weighted clustering problem so as to find better initial cluster centers based on the hierarchical approach. The experimental results show that the proposed approach needs less iteration time compared with existing approaches and has better performance in terms of convergence speed and ability to reduce the impact of noises.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
J.F. Lu, J.B. Tang, Z.M. Tang, J.Y. Yang,