Improved Hierarchical K-means Clustering Algorithm without Iteration Based on Distance Measurement

Abstract : Hierarchical K-means has got rapid development and wide application because of combining the advantage of high accuracy of hierarchical algorithm and fast convergence of K-means in recent years. Traditional HK clustering algorithm first determines to the initial cluster centers and the number of clusters by agglomerative algorithm, but agglomerative algorithm merges two data objects of minimum distance in dataset every time. Hence, its time complexity can not be acceptable for analyzing huge dataset. In view of the above problem of the traditional HK, this paper proposes a new clustering algorithm iHK. Its basic idea is that the each layer of the N data objects constructs $\lceil{{N}\over{2}} \rceil$ clusters by running K-means algorithm, and the mean vector of each cluster is used as the input of the next layer. iHK algorithm is tested on many different types of dataset and excellent experimental results are got.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [16 references]

https://hal.inria.fr/hal-01383315
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, October 18, 2016 - 2:52:37 PM
Last modification on : Thursday, March 5, 2020 - 5:41:03 PM

File

978-3-662-44980-6_5_Chapter.pd...
Files produced by the author(s)

Citation

Wenhua Liu, yongquan Liang, Jiancong Fan, Zheng Feng, yuhao Cai. Improved Hierarchical K-means Clustering Algorithm without Iteration Based on Distance Measurement. 8th International Conference on Intelligent Information Processing (IIP), Oct 2014, Hangzhou, China. pp.38-46, ⟨10.1007/978-3-662-44980-6_5⟩. ⟨hal-01383315⟩

Record views