The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A method for initialising the K-means clustering algorithm using kd-trees
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
(1967) · Cited by 23,719
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
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
Finding Groups in Data: An Introduction to Cluster Analysis.
Sarle, W. S., Kaufman, L., & Rousseeuw, P. J. (1991) · Journal of the American Statistical Association · doi:10.2307/2290430 · Cited by 3,539
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV
Roy, H. L. L., Lecam, L., & Neyman, J. (1969) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402306 · Cited by 2,835
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
Fast approximate spectral clustering
Yan, D., Huang, L., & Jordan, M. I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557118 · Cited by 474
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
An efficient k′-means clustering algorithm
Žalik, K. R. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.02.014 · Cited by 370
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
Metadata
- Authors
- Redmond, S. J., & Heneghan, C.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2007-06
- Volume
- 28
- Issue
- 8
- Pages
- 965-973
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W1989270503
- Cited by
- 261
- References
- 18
- FWCI
- 16.15
- 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: A method for initialising the K-means clustering algorithm using kd-trees. https://app.cochat.ai/papers/10.1016/j.patrec.2007.01.001
- The paper
- Redmond, S. J., & Heneghan, C. (2007). A method for initialising the K-means clustering algorithm using kd-trees. Pattern Recognition Letters. https://doi.org/10.1016/j.patrec.2007.01.001
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.