The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Alternatives to the k-means algorithm that find better clusterings
Open accessAbstract
We investigate here the behavior of the standard k-means clustering algorithm and several alternatives to it: the k-harmonic means algorithm due to Zhang and colleagues, fuzzy k-means, Gaussian expectation-maximization, and two new variants of k-harmonic means. Our aim is to find which aspects of these algorithms contribute to finding good clusterings, as opposed to converging to a low-quality local optimum. We describe each algorithm in a unified framework that introduces separate cluster membership and data weight functions. We then show that the algorithms do behave very differently from each other on simple low-dimensional synthetic datasets and image segmentation tasks, and that the k-harmonic means method is superior. Having a soft membership function is essential for finding high-quality clusterings, but having a non-constant data weight function is useful also.
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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
Zadeh, L. A. (1996) · Cited by 46,852
(1967) · Cited by 23,719
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
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
Proceedings of the fifth Berkeley symposium on mathematical statistics and probability.
Kojima, K.-I. (1969) · Europe PMC (PubMed Central) · Cited by 3,648
Cited by
Christ, A., Kainz, W., Hahn, E. G., Honegger, K., Zefferer, M., Neufeld, E., Rascher, W., Janka, R., Bautz, W., Chen, J., et al. (2010) · Physics in Medicine and Biology · doi:10.1088/0031-9155/55/2/n01 · Cited by 1,439
Selection of K in K-means clustering
Pham, D. T., Dimov, S. S., & Nguyen, C. D. (2005) · Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science · doi:10.1243/095440605x8298 · Cited by 597
Gosselin, M.-C., Neufeld, E., Moser, H., Huber, E., Farcito, S., Gerber, L., Jedensjö, M., Hilber, I., Gennaro, F. D., Lloyd, B., et al. (2014) · Physics in Medicine and Biology · doi:10.1088/0031-9155/59/18/5287 · Cited by 520
An overview of clustering methods
Omran, M. G. H., Engelbrecht, A. P., & Salman, A. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11602 · Cited by 424
PARTICLE SWARM OPTIMIZATION METHOD FOR IMAGE CLUSTERING
OMRAN, M., ENGELBRECHT, A. P., & SALMAN, A. (2005) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001405004083 · Cited by 288
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
Li, M. J., Ng, M. K., Cheung, Y.-M., & Huang, J. Z. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.88 · Cited by 281
Metadata
- Authors
- Hamerly, G., & Elkan, C.
- Venue
- Proceedings of the eleventh international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2002-11-04
- Pages
- 600-607
- OpenAlex
- W2131074607
- Cited by
- 426
- References
- 18
- FWCI
- 4.89
- Type
- conference paper
- Language
- en
- Open access
- green
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.