Research on K-Value Selection Method of K-Means Clustering Algorithm
J · 18.06.2019 · 2 (2) · 226-235
DOI: 10.3390/j2020016 ↗Kurz gefasst
Fachartikel in der Zeitschrift J, online erschienen am 18.06.2019. Verfasst von Chunhui Yuan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 438-mal zitiert (Crossref) und nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Among many clustering algorithms, the K-means clustering algorithm is widely used because of its simple algorithm and fast convergence. However, the K-value of clustering needs to be given in advance and the choice of K-value directly affect the convergence result. To solve this problem, we mainly analyze four K-value selection algorithms, namely Elbow Method, Gap Statistic, Silhouette Coefficient, and Canopy; give the pseudo code of the algorithm; and use the standard data set Iris for experimental verification. Finally, the verification results are evaluated, the advantages and disadvantages of the above four algorithms in a K-value selection are given, and the clustering range of the data set is pointed out.
Zitieren
APA
Yuan, C., & Yang, H. (2019). Research on K-Value Selection Method of K-Means Clustering Algorithm. J, 2(2), 226-235. https://doi.org/10.3390/j2020016
Vancouver
Yuan C, Yang H. Research on K-Value Selection Method of K-Means Clustering Algorithm. J. 2019;2(2):226-235. doi:10.3390/j2020016
BibTeX
@article{Yuan2019,
author = {Yuan, Chunhui and Yang, Haitao},
title = {Research on K-Value Selection Method of K-Means Clustering Algorithm},
journal = {J},
year = {2019},
volume = {2},
number = {2},
pages = {226--235},
doi = {10.3390/j2020016}
}
EUVIMED