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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
(1967) · Cited by 23,719
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Silhouettes: A graphical aid to the interpretation and validation of cluster analysis
Rousseeuw, P. J. (1987) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(87)90125-7 · Cited by 21,392
Kass, R. E., & Raftery, A. E. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476572 · Cited by 12,558
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Research works printed but not linked: 8
- 10.1016/j.patcog.2017.05.017 · doi:10.1016/j.patcog.2017.05.017
- blake, 1998, UCI repository of machine learning databases a huge collection of artificial and real-world data sets
- 10.1109/TNNLS.2016.2608354 · doi:10.1109/tnnls.2016.2608354
- 10.1016/j.patcog.2017.12.014 · doi:10.1016/j.patcog.2017.12.014
- 10.1109/ACCESS.2018.2884956 · doi:10.1109/access.2018.2884956
- iic, 2012, Modified Dunn’s cluster validity index based on graph theory, Przeglad Elektrotechniczny (Elect Rev ), 88, 126
- 10.1016/S0031-3203(96)00127-6 · doi:10.1016/s0031-3203(96)00127-6
- rendón, 2011, Internal versus external cluster validation indexes, Int J Comput Commun, 5, 27
Cited by
Ikotun, A. M., Ezugwu, A. E., Abualigah, L., Abuhaija, B., & Heming, J. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.139 · Cited by 2,272
The Effects of Data Quality on Machine Learning Performance on Tabular Data
Mohammed, S., Budach, L., Feuerpfeil, M., Ihde, N., Nathansen, A., Noack, N., Patzlaff, H., Naumann, F., & Harmouch, H. (2025) · Information Systems · doi:10.1016/j.is.2025.102549 · Cited by 331
Visan, A. I., & Negut, I. (2024) · Life · doi:10.3390/life14020233 · Cited by 279
Artificial intelligence in pancreatic cancer
Huang, B., Huang, H., Zhang, S., Zhang, D., Shi, Q., Liu, J., & Guo, J. (2022) · Theranostics · doi:10.7150/thno.77949 · Cited by 142
“Examples of such algorithms include K-mean clustering [53], Principal Component Analysis (PCA) [54], Non-negative Matrix Factorization (NMF) [55], etc.”
MethodReliable customer analysis using federated learning and exploring deep-attention edge intelligence
Ahmed, U., Srivastava, G., & Lin, J. C.-W. (2022) · Future Generation Computer Systems · doi:10.1016/j.future.2021.08.028 · Cited by 52
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.