The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An efficient k′-means clustering algorithm
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1998) · Springer Series in Statistics · doi:10.1007/978-1-4612-1694-0_15 · Cited by 17,781
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Bozdogan, H. (1987) · Psychometrika · doi:10.1007/bf02294361 · Cited by 4,468
Cluster center initialization algorithm for K-means clustering
Khan, S. S., & Ahmad, A. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.04.007 · Cited by 685
Competitive learning algorithms for vector quantization
Ahalt, S. C., Krishnamurthy, A. K., Chen, P., & Melton, D. E. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90071-r · Cited by 670
Rival penalized competitive learning for clustering analysis, RBF net, and curve detection
Xu, L., Krzyzak, A., & Oja, E. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238318 · Cited by 613
Minimum Message Length and Kolmogorov Complexity
Wallace, C. S. (1999) · The Computer Journal · doi:10.1093/comjnl/42.4.270 · Cited by 347
Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques
Steinley, D., & Brusco, M. J. (2007) · Journal of Classification · doi:10.1007/s00357-007-0003-0 · Cited by 316
A method for initialising the K-means clustering algorithm using kd-trees
Redmond, S. J., & Heneghan, C. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2007.01.001 · Cited by 261
Cited by
An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis
Niknam, T., & Amiri, B. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.07.001 · Cited by 433
A review on brain tumor segmentation of MRI images
Wadhwa, A., Bhardwaj, A., & Singh Verma, V. (2019) · Magnetic Resonance Imaging · doi:10.1016/j.mri.2019.05.043 · Cited by 374
Twitter sentiment analysis using hybrid cuckoo search method
Chandra Pandey, A., Singh Rajpoot, D., & Saraswat, M. (2017) · Information Processing & Management · doi:10.1016/j.ipm.2017.02.004 · Cited by 299
A review on particle swarm optimization algorithms and their applications to data clustering
Rana, S., Jasola, S., & Kumar, R. (2011) · Artificial Intelligence Review · doi:10.1007/s10462-010-9191-9 · Cited by 271
Metadata
- Authors
- Žalik, K. R.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2008-07
- Volume
- 29
- Issue
- 9
- Pages
- 1385-1391
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W2125836634
- Cited by
- 370
- References
- 12
- FWCI
- 21.20
- 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: An efficient k′-means clustering algorithm. https://app.cochat.ai/papers/10.1016/j.patrec.2008.02.014
- The paper
- Žalik, K. R. (2008). An efficient k′-means clustering algorithm. Pattern Recognition Letters. https://doi.org/10.1016/j.patrec.2008.02.014
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.