The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The MinMax k-Means clustering algorithm
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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
An Introduction to Data Mining
Stephens, C. R., & Sukumar, R. (2006) · The Handbook of Marketing Research · doi:10.4135/9781412973380.n22 · Cited by 4,562
The global k-means clustering algorithm
Likas, A., Vlassis, N., & J. Verbeek, J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00060-2 · Cited by 3,733
Self-citation
Cited by
Liu, Y., Wu, J., Wang, Z., Lu, X.-G., Avdeev, M., Shi, S., Wang, C., & Yu, T. (2020) · Acta Materialia · doi:10.1016/j.actamat.2020.05.001 · Cited by 271
Metadata
- Authors
- Tzortzis, G., & Likas, A.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2014-07
- Volume
- 47
- Issue
- 7
- Pages
- 2505-2516
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2171098181
- Cited by
- 272
- References
- 23
- FWCI
- 18.82
- 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: The MinMax k-Means clustering algorithm. https://app.cochat.ai/papers/10.1016/j.patcog.2014.01.015
- The paper
- Tzortzis, G., & Likas, A. (2014). The MinMax k-Means clustering algorithm. Pattern Recognition. https://doi.org/10.1016/j.patcog.2014.01.015
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.