Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 2,244

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

Unsupervised K-Means Clustering Algorithm

Open access
Sinaga, Kristina P., Yang, Miin-Shen·2020·IEEE Access

Abstract

The k-means algorithm is generally the most known and used clustering method. There are various extensions of k-means to be proposed in the literature. Although it is an unsupervised learning to clustering in pattern recognition and machine learning, the k-means algorithm and its extensions are always influenced by initializations with a necessary number of clusters a priori. That is, the k-means algorithm is not exactly an unsupervised clustering method. In this paper, we construct an unsupervised learning schema for the k-means algorithm so that it is free of initializations without parameter selection and can also simultaneously find an optimal number of clusters. That is, we propose a novel unsupervised k-means (U-k-means) clustering algorithm with automatically finding an optimal number of clusters without giving any initialization and parameter selection. The computational complexity of the proposed U-k-means clustering algorithm is also analyzed. Comparisons between the proposed U-k-means and other existing methods are made. Experimental results and comparisons actually demonstrate these good aspects of the proposed U-k-means clustering algorithm.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/access.2020.2988796

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

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 33 references

Research works printed but not linked: 8

  1. 10.1016/j.patcog.2017.05.017 · doi:10.1016/j.patcog.2017.05.017
  2. blake, 1998, UCI repository of machine learning databases a huge collection of artificial and real-world data sets
  3. 10.1109/TNNLS.2016.2608354 · doi:10.1109/tnnls.2016.2608354
  4. 10.1016/j.patcog.2017.12.014 · doi:10.1016/j.patcog.2017.12.014
  5. 10.1109/ACCESS.2018.2884956 · doi:10.1109/access.2018.2884956
  6. iic, 2012, Modified Dunn’s cluster validity index based on graph theory, Przeglad Elektrotechniczny (Elect Rev ), 88, 126
  7. 10.1016/S0031-3203(96)00127-6 · doi:10.1016/s0031-3203(96)00127-6
  8. rendón, 2011, Internal versus external cluster validation indexes, Int J Comput Commun, 5, 27

Cited by

See all 2,244

Metadata

Authors
Sinaga, K. P., & Yang, M.-S.
Venue
IEEE Access
Published
2020
Volume
8
Pages
80716-80727
ISSN
2169-3536 (ISSN-L)
OpenAlex
W3019913914
Cited by
2,244
References
33
FWCI
79.56
Type
journal article
Language
en
Open access
gold
Funders
Ministry of Science and Technology, Taiwan (MOST 107-2118-M-033-002-MY2)

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: Unsupervised K-Means Clustering Algorithm. https://app.cochat.ai/papers/10.1109/access.2020.2988796
The paper
Sinaga, K. P., & Yang, M.-S. (2020). Unsupervised K-Means Clustering Algorithm. IEEE Access. https://doi.org/10.1109/access.2020.2988796

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.