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.
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
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
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344 · cited 2×
“Hierarchical clustering was the earliest clustering method used by biologists and social scientists, whereas cluster analysis became a branch of statistical multivariate analysis [1], [2].”
MethodAlgorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
Dunn, J. C. (1973) · Journal of Cybernetics · doi:10.1080/01969727308546046 · Cited by 5,049
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
Bozdogan, H. (1987) · Psychometrika · doi:10.1007/bf02294361 · Cited by 4,468
On Clustering Validation Techniques
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1012801612483 · Cited by 2,646
Graph Regularized Nonnegative Matrix Factorization for Data Representation
Cai, D., He, X., Han, J., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.231 · Cited by 2,451
Kass, R. E., & Raftery, A. E. (1995) · Journal of the American Statistical Association · doi:10.2307/2291091 · Cited by 2,312
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Unsupervised learning of finite mixture models
Figueiredo, M. A. T., & Jain, A. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990138 · Cited by 2,125
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
Mixture Models: Inference and Applications to Clustering.
Lindsay, B., McLachlan, G. L., Basford, K. E., & Dekker, M. (1989) · Journal of the American Statistical Association · doi:10.2307/2289892 · Cited by 1,062
Learning a Spatially Smooth Subspace for Face Recognition
Cai, D., He, X., Hu, Y., Han, J., & Huang, T. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383054 · Cited by 376
A robust EM clustering algorithm for Gaussian mixture models
Yang, M.-S., Lai, C.-Y., & Lin, C.-Y. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2012.04.031 · Cited by 366
Self-citationLv, Z., Liu, T., Shi, C., Benediktsson, J. A., & Du, H. (2019) · IEEE Access · doi:10.1109/access.2019.2892648 · Cited by 126
Revisiting K-Means and Topic Modeling, a Comparison Study to Cluster Arabic Documents
Alhawarat, M. O., & Hegazi, M. O. (2018) · IEEE Access · doi:10.1109/access.2018.2852648 · Cited by 105
Efficient registration of multi-view point sets by K-means clustering
Zhu, J., Jiang, Z., Evangelidis, G., Zhang, C., Pang, S., & Li, Z. (2019) · Information Sciences · doi:10.1016/j.ins.2019.03.024 · Cited by 96
A new distance with derivative information for functional k-means clustering algorithm
Meng, Y., Liang, J., Cao, F., & He, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.06.035 · Cited by 89
A Survey on Internal Validity Measure for Cluster Validation
Deborah, L. J., Baskaran, R., & Kannan, A. (2010) · International Journal of Computer Science & Engineering Survey · doi:10.5121/ijcses.2010.1207 · Cited by 83
External validation measures for K-means clustering: A data distribution perspective
Wu, J., Chen, J., Xiong, H., & Xie, M. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.06.093 · Cited by 74
Ground truth bias in external cluster validity indices
Lei, Y., Bezdek, J. C., Romano, S., Vinh, N. X., Chan, J., & Bailey, J. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.12.003 · Cited by 55
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
- 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
Assessment of global health risk of antibiotic resistance genes
Zhang, Z., Zhang, Q., Wang, T., Xu, N., Lu, T., Hong, W., Penuelas, J., Gillings, M., Wang, M., Gao, W., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-29283-8 · Cited by 976
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
An, Q., Rahman, S., Zhou, J., & Kang, J. J. (2023) · Sensors · doi:10.3390/s23094178 · Cited by 340
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
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
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.