Fast adaptive k-means clustering: some empirical results
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The authors present learning rate schedules for fast adaptivek-means clustering which surpass the standard MacQueen learning rate schedule (J. MacQeen, 1967) in speed and quality of solution by several orders of magnitude for largek. The methods accomplish this by largely overcoming the problems of metastable local minima and nonstationarity of cluster region boundaries which plague the MacQueen approach. The authors use simulation results to compare the clustering performances of four learning rate schedules applied to independently sampled data from a uniform distribution in one and two dimensions
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
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Cited by
Image segmentation evaluation: A survey of unsupervised methods
Zhang, H., Fritts, J. E., & Goldman, S. A. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.08.003 · Cited by 963
“Examples of these methods include clustering [48], adaptive K-means method [49], and histogram thresholding [50], among others.”
MethodThree learning phases for radial-basis-function networks
Schwenker, F., Kestler, H. A., & Palm, G. (2001) · Neural Networks · doi:10.1016/s0893-6080(01)00027-2 · Cited by 533
Metadata
- Authors
- Darken, C., & Moody, J.
- Venue
- 1990 IJCNN International Joint Conference on Neural Networks
- Publisher
- IEEE
- Published
- 1990
- Pages
- 233-238 vol.2
- ISSN
- 2161-4407 (ISSN-L)
- OpenAlex
- W1995643764
- Cited by
- 162
- References
- 3
- FWCI
- 2.64
- Type
- conference paper
- 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: Fast adaptive k-means clustering: some empirical results. https://app.cochat.ai/papers/10.1109/ijcnn.1990.137720
- The paper
- Darken, C., & Moody, J. (1990). Fast adaptive k-means clustering: some empirical results. 1990 IJCNN International Joint Conference on Neural Networks. https://doi.org/10.1109/ijcnn.1990.137720
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.