The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algorithm AS 136: A K-Means Clustering Algorithm
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“First, k-means does not account for uncertainty associated with yield environment classifications [1, 19].”
From A Bayesian framework to model variance of grain yield response to plant density (2025) · cites this paper as [19]
Citations
Cites
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Self-citationAlgorithm AS 58: Euclidean Cluster Analysis
Sparks, D. N. (1973) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2346321 · Cited by 223
Cited by
Modern Applied Statistics with S
Venables, W. N., & Ripley, B. D. (2002) · Statistics and Computing · doi:10.1007/978-0-387-21706-2 · Cited by 24,305
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“Thus such techniques can have quadratic complexity if the clustering technique requires computation of pairwise distances for all data instances, or linear when using heuristic based techniques such as k-means [Hartigan and Wong 1979] or approximate clustering techniques [Eskin et al.”
MethodModel-Based Clustering, Discriminant Analysis, and Density Estimation
Fraley, C., & Raftery, A. E. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502760047131 · Cited by 4,257
THE ANTECEDENTS, CONSEQUENCES, AND MEDIATING ROLE OF ORGANIZATIONAL AMBIDEXTERITY.
Gibson, C. B., & Birkinshaw, J. (2004) · Academy of Management Journal · doi:10.2307/20159573 · Cited by 3,919
Metadata
- Authors
- Hartigan, J. A., & Wong, M. A.
- Affiliations
- Yale University (US)
- ORCID
- Hartigan, J. A.
- Venue
- Applied Statistics
- Publisher
- JSTOR
- Published
- 1979
- Volume
- 28
- Issue
- 1
- Pages
- 100
- ISSN
- 0035-9254 (ISSN-L)
- OpenAlex
- W1977556410
- Cited by
- 14,523
- References
- 2
- Citations by year
- 2026: 433 · 2025: 894 · 2024: 1038 · 2023: 1142 · 2022: 1095 · 2021: 1154 · 2020: 1101 · 2019: 1092 · 2018: 954 · 2017: 802 · 2016: 753 · 2015: 637 · 2014: 571 · 2013: 478 · 2012: 453
- FWCI
- 3.56
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Journal of the Royal Statistical Society Series C (Applied Statistics) (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Keywords
- K-means clustering, clustering, partitioning algorithms
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.