The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Cluster center initialization algorithm for K-means clustering
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
(1967) · Cited by 23,719
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
Cited by
A simple and fast algorithm for K-medoids clustering
Park, H.-S., & Jun, C.-H. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.01.039 · Cited by 2,104
Image Segmentation Using K -means Clustering Algorithm and Subtractive Clustering Algorithm
Dhanachandra, N., Manglem, K., & Chanu, Y. J. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.06.090 · Cited by 1,103
State of the Art in Defect Detection Based on Machine Vision
Ren, Z., Fang, F., Yan, N., & Wu, Y. (2022) · International Journal of Precision Engineering and Manufacturing-Green Technology · doi:10.1007/s40684-021-00343-6 · Cited by 799
A k-mean clustering algorithm for mixed numeric and categorical data
Ahmad, A., & Dey, L. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.016 · Cited by 718
Self-citationAn efficient k′-means clustering algorithm
Žalik, K. R. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.02.014 · Cited by 370
kml and kml3d:R Packages to Cluster Longitudinal Data
Genolini, C., Alacoque, X., Sentenac, M., & Arnaud, C. (2015) · Journal of Statistical Software · doi:10.18637/jss.v065.i04 · Cited by 312
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
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
Survey of State-of-the-Art Mixed Data Clustering Algorithms
Ahmad, A., & Khan, S. S. (2019) · IEEE Access · doi:10.1109/access.2019.2903568 · Cited by 253
Self-citationChen, A. T., Wu, S., Tomasino, K. N., Lattie, E. G., & Mohr, D. C. (2019) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2019.103187 · Cited by 58
“The k-means clustering method can be susceptible to the values that were used to initialize the clustering[42].”
MethodGubbi, J., Kusmakar, S., Rao, A. S., Yan, B., OBrien, T., & Palaniswami, M. (2016) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2015.2446539 · Cited by 41
Metadata
- Authors
- Khan, S. S., & Ahmad, A.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2004-08
- Volume
- 25
- Issue
- 11
- Pages
- 1293-1302
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W2142458924
- Cited by
- 685
- References
- 30
- FWCI
- 6.78
- 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
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.