The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
How slow is the k -means method?
Abstract
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known on its running time. In this paper, we demonstrate that the worst-case running time of k-means is superpolynomial by improving the best known lower bound from Ω(n) iterations to 2Ω(√n).
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
A local search approximation algorithm for k-means clustering
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · Proceedings of the eighteenth annual symposium on Computational geometry · doi:10.1145/513400.513402 · Cited by 474
Inaba, M., Katoh, N., & Imai, H. (1994) · Proceedings of the tenth annual symposium on Computational geometry - SCG '94 · doi:10.1145/177424.178042 · Cited by 321
Large-Scale Clustering of cDNA-Fingerprinting Data
Herwig, R., Poustka, A. J., Müller, C., Bull, C., Lehrach, H., & O'Brien, J. (1999) · Genome Research · doi:10.1101/gr.9.11.1093 · Cited by 221
k -means projective clustering
Agarwal, P. K., & Mustafa, N. H. (2004) · Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1055558.1055581 · Cited by 184
A fast hybrid k-means level set algorithm for segmentation
Gibou, F. (2005) · Cited by 152
Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method
Arthur, D., & Vassilvitskii, S. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.79 · Cited by 64
Self-citation
Cited by
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Self-citationBahmani, B., Moseley, B., Vattani, A., Kumar, R., & Vassilvitskii, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2180912.2180915 · Cited by 628
Self-citationData stream clustering: A survey
Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J. (2013) · ACM Computing Surveys · doi:10.1145/2522968.2522981 · Cited by 508
Imbalanced Deep Learning by Minority Class Incremental Rectification
Dong, Q., Gong, S., & Zhu, X. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2832629 · Cited by 369
The Planar k-Means Problem is NP-Hard
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00202-1_24 · Cited by 308
Metadata
- Authors
- Arthur, D., & Vassilvitskii, S.
- Venue
- Proceedings of the twenty-second annual symposium on Computational geometry
- Publisher
- ACM
- Published
- 2006-06-05
- Pages
- 144-153
- OpenAlex
- W1998739300
- Cited by
- 304
- References
- 11
- FWCI
- 9.60
- Type
- conference paper
- 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: How slow is the k -means method? https://app.cochat.ai/papers/10.1145/1137856.1137880
- The paper
- Arthur, D., & Vassilvitskii, S. (2006). How slow is the k -means method? Proceedings of the twenty-second annual symposium on Computational geometry. https://doi.org/10.1145/1137856.1137880
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.