The global k-means clustering algorithm
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
Textures: A Photographic Album for Artists and Designers
Hersey, I., & Brodatz, P. (1968) · Leonardo · doi:10.2307/1571915 · Cited by 2,626
Pattern Recognition and Neural Networks
Fulkerson, B. (1997) · Technometrics · doi:10.1080/00401706.1997.10485099 · Cited by 1,371
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
Learning mixtures of Gaussians
Dasgupta, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814639 · Cited by 588
Refinements to nearest-neighbor searching ink-dimensional trees
Sproull, R. F. (1991) · Algorithmica · doi:10.1007/bf01759061 · Cited by 434
A Greedy EM Algorithm for Gaussian Mixture Learning
Vlassis, N., & Likas, A. (2002) · Neural Processing Letters · doi:10.1023/a:1013844811137 · Cited by 300
Self-citationA kurtosis-based dynamic approach to Gaussian mixture modeling
Vlassis, N. A., & Likas, A. C. (1999) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/3468.769758 · Cited by 90
Self-citation
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Ikotun, A. M., Ezugwu, A. E., Abualigah, L., Abuhaija, B., & Heming, J. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.139 · Cited by 2,272
The k-means Algorithm: A Comprehensive Survey and Performance Evaluation
Ahmed, M., Seraj, R., & Islam, S. M. S. (2020) · Electronics · doi:10.3390/electronics9081295 · Cited by 1,717
“Experimental analysis with k-means [9], x-means [49], constrained k-means [54], k-prototype [63], and kernel k-means [74] was performed, and a performance comparison in terms of the metrics described above was made.”
A comparative study of efficient initialization methods for the k-means clustering algorithm
Celebi, M. E., Kingravi, H. A., & Vela, P. A. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.07.021 · Cited by 1,214
K‐means clustering: A half‐century synthesis
Steinley, D. (2006) · British Journal of Mathematical and Statistical Psychology · doi:10.1348/000711005x48266 · Cited by 1,120
Metadata
- Authors
- Likas, A., Vlassis, N., & J. Verbeek, J.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2003-02
- Volume
- 36
- Issue
- 2
- Pages
- 451-461
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2140405352
- Cited by
- 3,733
- References
- 13
- FWCI
- 20.07
- Type
- journal article
- Language
- en
- Open access
- green
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
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.