The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
NP-hardness of Euclidean sum-of-squares clustering
Open accessOverview
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
(1967) · Cited by 23,719
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Cluster analysis and mathematical programming
Hansen, P., & Jaumard, B. (1997) · Mathematical Programming · doi:10.1007/bf02614317 · Cited by 646
Self-citationClustering Large Graphs via the Singular Value Decomposition
Petros Drineas, B., FRIEZE, A. M., Kannan, R., Vempala, S., & Vinay, V. (2004) · Machine Learning · doi:10.1023/b:mach.0000033113.59016.96 · Cited by 487
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
Ostrovsky, R., Rabani, Y., Schulman, L., & Swamy, C. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.75 · Cited by 261
Online clustering of parallel data streams
Beringer, J., & Hüllermeier, E. (2006) · Data & Knowledge Engineering · doi:10.1016/j.datak.2005.05.009 · Cited by 241
Sparsest cuts and bottlenecks in graphs
Matula, D. W., & Shahrokhi, F. (1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90133-w · Cited by 97
On the Complexity of Several Haplotyping Problems
Cilibrasi, R., van Iersel, L. J. J., Kelk, S. M., & Tromp, J. (2005) · Lecture notes in computer science · doi:10.1007/11557067_11 · Cited by 84
Cited by
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
A Comprehensive Survey of Loss Functions in Machine Learning
Wang, Q., Ma, Y., Zhao, K., & Tian, Y. (2022) · Annals of Data Science · doi:10.1007/s40745-020-00253-5 · Cited by 711
k-Shape: Efficient and Accurate Clustering of Time Series
Paparrizos, J., & Gravano, L. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2737793 · Cited by 680
Bahmani, B., Moseley, B., Vattani, A., Kumar, R., & Vassilvitskii, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2180912.2180915 · Cited by 628
Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming
Wang, H., & Song, M. (2011) · The R Journal · doi:10.32614/rj-2011-015 · Cited by 374
Metadata
- Authors
- Aloise, D., Deshpande, A., Hansen, P., & Popat, P.
- Venue
- Machine Learning
- Published
- 2009-01-24
- Volume
- 75
- Issue
- 2
- Pages
- 245-248
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2086959852
- Cited by
- 867
- References
- 8
- FWCI
- 33.25
- Type
- journal article
- Language
- en
- Open access
- bronze
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.