The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Selection of K in K-means clustering
Abstract
The K-means algorithm is a popular data-clustering algorithm. However, one of its drawbacks is the requirement for the number of clusters, K, to be specified before the algorithm is applied. This paper first reviews existing methods for selecting the number of clusters for the algorithm. Factors that affect this selection are then discussed and a new measure to assist the selection is proposed. The paper concludes with an analysis of the results of using the proposed measure to determine the number of clusters for the K-means algorithm for different data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Scale-Space Theory in Computer Vision
Lindeberg, T. (1994) · Springer eBooks · doi:10.1007/978-1-4757-6465-9 · Cited by 2,169
Barlow, H. B. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.295 · Cited by 1,650
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
An empirical comparison of four initialization methods for the K-Means algorithm
Peña, J. M., Lozano, J. A., & Larrañaga, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00069-0 · Cited by 866
Cited by
Automatic Database Management System Tuning Through Large-scale Machine Learning
Van Aken, D., Pavlo, A., Gordon, G. J., & Zhang, B. (2017) · Proceedings of the 2017 ACM International Conference on Management of Data · doi:10.1145/3035918.3064029 · Cited by 573
What is Machine Learning? A Primer for the Epidemiologist
Bi, Q., Goodman, K. E., Kaminsky, J., & Lessler, J. (2019) · American Journal of Epidemiology · doi:10.1093/aje/kwz189 · Cited by 496
Capturing value from big data – a taxonomy of data-driven business models used by start-up firms
Hartmann, P. M., Zaki, M., Feldmann, N., & Neely, A. (2016) · International Journal of Operations & Production Management · doi:10.1108/ijopm-02-2014-0098 · Cited by 411
Temperature management for the quality assurance of a perishable food supply chain
Aung, M. M., & Chang, Y. S. (2014) · Food Control · doi:10.1016/j.foodcont.2013.11.016 · Cited by 394
Application of machine learning to the monitoring and prediction of food safety: A review
Wang, X., Bouzembrak, Y., Lansink, A. O., & van der Fels‐Klerx, H. J. (2022) · Comprehensive Reviews in Food Science and Food Safety · doi:10.1111/1541-4337.12868 · Cited by 256
Metadata
- Authors
- Pham, D. T., Dimov, S. S., & Nguyen, C. D.
- Venue
- Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science
- Publisher
- SAGE Publications
- Published
- 2005-01-01
- Volume
- 219
- Issue
- 1
- Pages
- 103-119
- ISSN
- 0263-7154 (ISSN-L)
- 0954-4062
- 2041-2983
- OpenAlex
- W2006907251
- Cited by
- 597
- References
- 20
- FWCI
- 1.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Selection of K in K-means clustering. https://app.cochat.ai/papers/10.1243/095440605x8298
- The paper
- Pham, D. T., Dimov, S. S., & Nguyen, C. D. (2005). Selection of K in K-means clustering. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science. https://doi.org/10.1243/095440605x8298
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.