The DOI matches its Crossref record; 74 of the 74 references it cites were found in a registry or an index.
A comparative study of efficient initialization methods for the k-means clustering algorithm
Open accessAbstract
K-means is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, due to its gradient descent nature, this algorithm is highly sensitive to the initial placement of the cluster centers. Numerous initialization methods have been proposed to address this problem. In this paper, we first present an overview of these methods with an emphasis on their computational efficiency. We then compare eight commonly used linear time complexity initialization methods on a large and diverse collection of data sets using various performance criteria. Finally, we analyze the experimental results using non-parametric statistical tests and provide recommendations for practitioners. We demonstrate that popular initialization methods often perform poorly and that there are in fact strong alternatives to these methods.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(1967) · Cited by 23,719
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
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
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Cited by
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
Syakur, M. A., Khotimah, B. K., Rochman, E. M. S., & Satoto, B. D. (2018) · IOP Conference Series: Materials Science and Engineering · doi:10.1088/1757-899x/336/1/012017 · Cited by 1,181
How much can k-means be improved by using better initialization and repeats?
Fränti, P., & Sieranoja, S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.04.014 · Cited by 451
Rashidi, H. H., Tran, N. K., Betts, E. V., Howell, L. P., & Green, R. (2019) · Academic Pathology · doi:10.1177/2374289519873088 · Cited by 371
Continental-scale animal tracking reveals functional movement classes across marine taxa
Brodie, S., Lédée, E. J. I., Heupel, M. R., Babcock, R. C., Campbell, H. A., Gledhill, D. C., Hoenner, X., Huveneers, C., Jaine, F. R. A., Simpfendorfer, C. A., et al. (2018) · Scientific Reports · doi:10.1038/s41598-018-21988-5 · Cited by 346
Medical Image Segmentation Methods, Algorithms, and Applications
Norouzi, A., Rahim, M. S. M., Altameem, A., Saba, T., Rad, A. E., Rehman, A., & Uddin, M. (2014) · IETE Technical Review · doi:10.1080/02564602.2014.906861 · Cited by 323
Woo, S. E., Jebb, A. T., Tay, L., & Parrigon, S. (2018) · Organizational Research Methods · doi:10.1177/1094428117752467 · Cited by 308
The MinMax k-Means clustering algorithm
Tzortzis, G., & Likas, A. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.01.015 · Cited by 272
Yang, J., Han, Y., Wang, Y., Jiang, B., Lv, Z., & Song, H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2017.12.012 · Cited by 104
Gómez Mateus, A. M., Domptail, S., Magiera, A., & Waldhardt, R. (2023) · Forest Ecology and Management · doi:10.1016/j.foreco.2023.121061 · Cited by 4
Metadata
- Authors
- Celebi, M. E., Kingravi, H. A., & Vela, P. A.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2013-01
- Volume
- 40
- Issue
- 1
- Pages
- 200-210
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2059515884
- Cited by
- 1,214
- References
- 74
- FWCI
- 34.20
- 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.