CoChat

The k-means Algorithm: A Comprehensive Survey and Performance Evaluation

Open access

The DOI matches its Crossref record; 76 of the 76 references it cites were found in a registry or an index.

Abstract

The k-means clustering algorithm is considered one of the most powerful and popular data mining algorithms in the research community. However, despite its popularity, the algorithm has certain limitations, including problems associated with random initialization of the centroids which leads to unexpected convergence. Additionally, such a clustering algorithm requires the number of clusters to be defined beforehand, which is responsible for different cluster shapes and outlier effects. A fundamental problem of the k-means algorithm is its inability to handle various data types. This paper provides a structured and synoptic overview of research conducted on the k-means algorithm to overcome such shortcomings. Variants of the k-means algorithms including their recent developments are discussed, where their effectiveness is investigated based on the experimental analysis of a variety of datasets. The detailed experimental analysis along with a thorough comparison among different k-means clustering algorithms differentiates our work compared to other existing survey papers. Furthermore, it outlines a clear and thorough understanding of the k-means algorithm along with its different research directions.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/electronics9081295

Cites

76 of 76 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Asimple taxonomy of variants of k-means algorithm.
Figure 1 Asimple taxonomy of variants of k-means algorithm.CC-BY · From the PDF
Figure 2 Refined initial instances, adapted from [54].
Figure 2 Refined initial instances, adapted from [54].CC-BY · From the PDF
Image 3
CC-BY · From the PDF
Image 4
CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 76 references

Research works printed but not linked: 1

  1. Mohri, M., Rostamizadeh, A., and Talwalkar, A. (2012). Foundations of Machine Learning, MIT Press.

Cited by

Items 901–1,000 of 1,001

Metadata

Authors
Ahmed, M., Seraj, R., & Islam, S. M. S.
Affiliations
  • Edith Cowan University (AU)
  • McGill University (CA)
Corresponding author
Ahmed, Mohiuddin
Venue
Electronics
Publisher
MDPI AG
Published
2020-08-12
Volume
9
Issue
8
Pages
1295
ISSN
2079-9292 (ISSN-L)
OpenAlex
W3048804154
Cited by
1,717
References
76
Citations by year
2026: 311 · 2025: 471 · 2024: 484 · 2023: 302 · 2022: 109 · 2021: 35 · 2020: 5
FWCI
44.33
Type
journal article
Language
en
Open access
Locations
  • Electronics (publishedVersion, cc-by)
  • UWA Profiles and Research Repository (UWA) (submittedVersion, cc-by)
  • Australasian Journal of Paramedicine (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
Keywords
K-means clustering, centroid initialization, optimal number of clusters, cluster shape, outliers, algorithm comparison, convergence

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.