The k-means Algorithm: A Comprehensive Survey and Performance Evaluation
Open accessThe 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.
Integrity signals
Registry
Cites
Statistics
Figures
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.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“First, k-means does not account for uncertainty associated with yield environment classifications [1, 19].”
From A Bayesian framework to model variance of grain yield response to plant density (2025) · cites this paper as [1]
Experimental — accuracy not yet measured
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033 · cited 1×
“In x-means clustering [49], the BIC (Bayesian information criterion) or “Schwarz criterion” [50,51] is utilised to find the number of k clusters.”
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
(1967) · Cited by 23,719
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667 · cited 1×
“This survey studies the problems of and solutions to partition-based clustering, and more specifically the widely used k-means algorithm [9], which has been listed among the top 10 clustering algorithms for data analysis [35].”
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
Bozdogan, H. (1987) · Psychometrika · doi:10.1007/bf02294361 · Cited by 4,468 · cited 1×
“In x-means clustering [49], the BIC (Bayesian information criterion) or “Schwarz criterion” [50,51] is utilised to find the number of k clusters.”
Research works printed but not linked: 1
- Mohri, M., Rostamizadeh, A., and Talwalkar, A. (2012). Foundations of Machine Learning, MIT Press.
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
Hussain, M. (2023) · Machines · doi:10.3390/machines11070677 · Cited by 1,217
“…automated hot-spot detection within PV cells based a modi fi ed version of the YOLO-v5 architecture. precision at varying scales, k-means clustering [48] is deployed for clustering the The fi rst improvement comes in the form of enhanced anchors and detection heads for the respective architecture.…”
MethodA Review on Autonomous Vehicles: Progress, Methods and Challenges
Parekh, D., Poddar, N., Rajpurkar, A., Chahal, M., Kumar, N., Joshi, G. P., & Cho, W. (2022) · Electronics · doi:10.3390/electronics11142162 · Cited by 517
“It associates every cluster with a centroid and aims to minimize the total sum of distances between cluster centroids and their data points iteratively [14].”
BackgroundK-Means and Alternative Clustering Methods in Modern Power Systems
Miraftabzadeh, S. M., Colombo, C. G., Longo, M., & Foiadelli, F. (2023) · IEEE Access · doi:10.1109/access.2023.3327640 · Cited by 245
“The K-means algorithm is a popular choice for clustering analysis in power systems due to its simplicity, efficiency, scalability, and ease of implementation [11], [12].”
BackgroundMethodInfluentialNetwork Abnormal Traffic Detection Model Based on Semi-Supervised Deep Reinforcement Learning
Dong, S., Xia, Y., & Peng, T. (2021) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2021.3120804 · Cited by 193
Artificial intelligence for carbon emissions using system of systems theory
Gaur, L., Afaq, A., Arora, G. K., & Khan, N. (2023) · Ecological Informatics · doi:10.1016/j.ecoinf.2023.102165 · Cited by 161
Poweleit, E. A., Vinks, A. A. T. M. M., & Mizuno, T. (2023) · Therapeutic Drug Monitoring · doi:10.1097/ftd.0000000000001078 · Cited by 180
“Common unsupervised learning algorithms include hierarchical clustering, 34,35 k-mean clustering, 36,37 and principal component analysis.”
Applications and Techniques of Machine Learning in Cancer Classification: A Systematic Review
Yaqoob, A., Aziz, R. M., & Verma, N. K. (2023) · Human-Centric Intelligent Systems · doi:10.1007/s44230-023-00041-3 · Cited by 164
Ashari, I. F., Nugroho, E., Baraku, R., Yanda, I. N., & Liwardana, R. (2023) · Journal of Applied Informatics and Computing · doi:10.30871/jaic.v7i1.4947 · Cited by 149
“This algorithm is included in the category of unsupervised learning, which can be used to classify data without labels [3].”
Artificial Intelligence Applied to Drone Control: A State of the Art
Caballero-Martin, D., López-Guede, J. M., Estévez, J., & Graña, M. (2024) · Drones · doi:10.3390/drones8070296 · Cited by 129
Song, H., Song, M., & Liu, X. (2022) · Applied Energy · doi:10.1016/j.apenergy.2022.119995 · Cited by 140
Ofori-Boateng, R., Aceves‐Martins, M., Wiratunga, N., & Moreno‐García, C. F. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10844-w · Cited by 146
Machine Learning and Artificial Intelligence in the Multi-Omics Approach to Gut Microbiota
Rozera, T., Pasolli, E., Segata, N., & Ianiro, G. (2025) · Gastroenterology · doi:10.1053/j.gastro.2025.02.035 · Cited by 112
Liao, H., He, Y., Wu, X., Wu, Z., & Baušys, R. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.101970 · Cited by 122
Machine Learning-Enabled Internet of Things (IoT): Data, Applications, and Industry Perspective
Bzai, J., Alam, F., Dhafer, A., Bojović, M., Altowaijri, S. M., Niazi, I. K., & Mehmood, R. (2022) · Electronics · doi:10.3390/electronics11172676 · Cited by 110
“Multiple works [67,68] show that there are two issues related to it: (1) outliers can pull these centers, and (2) rather than rejecting outliers, it can be possible for outliers to form their cluster.”
BackgroundMultiomics Research: Principles and Challenges in Integrated Analysis
Luo, Y., Zhao, C., & Chen, F. (2024) · BioDesign Research · doi:10.34133/bdr.0059 · Cited by 119
“Clustering analysis methods, including k -means [ 88 ], hierarchical clustering [ 89 ], and DBSCAN [ 90 ], are utilized to uncover natural groupings within the data, further aiding in the discovery of meaningful patterns and insights.”
K-means clustering algorithm: a brief review
Chong, B. (2021) · Academic Journal of Computing & Information Science · doi:10.25236/ajcis.2021.040506 · Cited by 106
Chadalavada, S., Faust, O., Salvi, M., Seoni, S., Raj, N., Raghavendra, U., Gudigar, A., Barua, P. D., Molinari, F., & Acharya, U. R. (2024) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2024.106312 · Cited by 96
Huang, Z., Li, K., Jiang, Y., Jia, Z., Lv, L., & Ma, Y. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.112311 · Cited by 91
“By analyzing the eigenvectors { 𝑢 1 , 𝑢 2 } associated with the two largest eigenvalues of 𝐿𝑎𝑝 𝑠 , we construct a feature matrix ∈ ℝ 𝑁 ×2 .”
Calinsky, R., & Levy, Y. (2024) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.4c04774 · Cited by 90
K and starting means for k-means algorithm
Fahim, A. (2021) · Journal of Computational Science · doi:10.1016/j.jocs.2021.101445 · Cited by 86
Trustworthy remote sensing interpretation: Concepts, technologies, and applications
Wang, S., Han, W., Zhang, X., Zhang, X., Wang, L., & Li, J. (2024) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2024.02.003 · Cited by 83
Transforming Complex Problems into K-means Solutions
Liu, H., Chen, J., Dy, J., & Fu, Y. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3237667 · Cited by 104
“In the literature, several surveys have been conducted on Kmeans from different aspects, including algorithm variants [79], [167], cluster number [80], [129], feature weighting [35], initialization [2], parallel computing [49], [72], theoretical analysis [17], and applications [3], [112].”
BackgroundAbavisani, M., Khoshrou, A., Foroushan, S. K., Ebadpour, N., & Sahebkar, A. (2024) · Current Research in Biotechnology · doi:10.1016/j.crbiot.2024.100211 · Cited by 75
Deep learning for object recognition: A comprehensive review of models and algorithms
Tsirtsakis, P., Zacharis, G., Maraslidis, G. S., & Fragulis, G. F. (2025) · International Journal of Cognitive Computing in Engineering · doi:10.1016/j.ijcce.2025.01.004 · Cited by 99
Yang, J., Xu, Y., Chen, P., Li, J., Liu, D., & Chu, X. (2023) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2023.139771 · Cited by 76
Machine learning–assisted triboelectric nanogenerator technology for intelligent sports
Ji, M., Wang, Z., Wu, J., Huang, L., Zheng, M., Cheng, G., Cai, H., Luo, J., Zhou, H., & Wang, Z. L. (2025) · Science Advances · doi:10.1126/sciadv.adz3515 · Cited by 72
Artificial Intelligence in Business-to-Customer Fashion Retail: A Literature Review
Goti, A., Lomas, L. Q., Almeida, A., de la Puerta, J. G., & López–de–Ipiña, D. (2023) · Mathematics · doi:10.3390/math11132943 · Cited by 69
“K-means is a vector quantization technique that was first used in signal processing to divide n observations into k clusters, with each observation belonging to the cluster that has the closest mean (also known as the cluster centroid or cluster center), which serves as a prototype for the cluster [29].”
MethodImproved K-Means Based Q Learning Algorithm for Optimal Clustering and Node Balancing in WSN
Sathyamoorthy, M., Kuppusamy, S., Dhanaraj, R. K., & Ravi, V. (2021) · Wireless Personal Communications · doi:10.1007/s11277-021-09028-4 · Cited by 67
“The two important problems occurs in k-means are random initialization and unpredictable convergence [14].”
BackgroundChatGPT in a programming course: benefits and limitations
Bringula, R. P. (2024) · Frontiers in Education · doi:10.3389/feduc.2024.1248705 · Cited by 77
Qin, Y., Chen, J., Jin, L., Yao, R., & Gong, Z. (2025) · Scientific Reports · doi:10.1038/s41598-024-84038-3 · Cited by 66
A review of Machine Learning (ML)-based IoT security in healthcare: A dataset perspective
Neto, E. C. P., Dadkhah, S., Sadeghi, S., Molyneaux, H., & Ghorbani, A. A. (2023) · Computer Communications · doi:10.1016/j.comcom.2023.11.002 · Cited by 64
A simulated annealing algorithm with a dual perturbation method for clustering
Lee, J., & Perkins, D. (2020) · Pattern Recognition · doi:10.1016/j.patcog.2020.107713 · Cited by 64
He, W., Cui, Y., Yang, H., Gao, J., Zhao, Y., Hao, N., Li, Y., & Zhang, M. (2023) · Journal of Hazardous Materials · doi:10.1016/j.jhazmat.2023.132681 · Cited by 67
A Novel Methodology for Unsupervised Anomaly Detection in Industrial Electrical Systems
Carratù, M., Gallo, V., Iacono, S. D., Sommella, P., Bartolini, A., Grasso, F., Ciani, L., & Patrizi, G. (2023) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2023.3318684 · Cited by 62
“The choice of K-means as the main algorithm for processing anomalous and normal points was motivated by its remarkable power, result explainability, and adaptability in data mining [44].”
BackgroundHan, F., Yu, J., Zhou, G., Li, S., & Sun, T. (2024) · Sustainable Cities and Society · doi:10.1016/j.scs.2024.105642 · Cited by 62
Sentiment analysis based on text information enhancement and multimodal feature fusion
Liu, Z., Cai, L., Yang, W., & Liu, J. (2024) · Pattern Recognition · doi:10.1016/j.patcog.2024.110847 · Cited by 59
Machine Learning for Structural Health Monitoring of Aerospace Structures: A Review
Scarselli, G., & Nicassio, F. (2025) · Sensors · doi:10.3390/s25196136 · Cited by 63
A Comprehensive Survey of Machine Learning: Advancements, Applications, and Challenges
Nithya, T., Kumar, V., Gayathri, S., Deepa, S., Varun, C. M., & Siva Subramanian, R. (2023) · International Conference on Augmented Intelligence and Sustainable Systems (ICAISS) · doi:10.1109/icaiss58487.2023.10250547 · Cited by 60
“The total of squared distances between the data points and their cluster centroids is what it seeks to minimise [10].”
BackgroundA Comprehensive Survey of Machine Learning Applied to Resource Allocation in Wireless Communications
Pivoto, D. G. S., de Figueiredo, F. A. P., Çavdar, Ç., Tejerina, G. R. D. L., & Mendes, L. L. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3552370 · Cited by 55
Advanced Control Systems in Industry 5.0 Enabling Process Mining
Massaro, A. S. (2022) · Sensors · doi:10.3390/s22228677 · Cited by 53
“In Figure 9b,c are illustrated the energy power trends and the power forecasting of the analyzed dataset [24] in the short and in the medium period, respectively.”
BackgroundMethodInfluentialHe, M., Jiang, S. S., Ren, L., Cui, H. L., Qin, T., Du, S., Zhu, Y., Fang, X., & Xu, C. (2024) · Journal of Hydrology · doi:10.1016/j.jhydrol.2024.131638 · Cited by 55
Khan, I. K., Daud, H., Zainuddin, N. B., Sokkalingam, R., Abdussamad, Museeb, A., & Inayat, A. (2024) · AIMS Mathematics · doi:10.3934/math.20241222 · Cited by 53
“We identify three primary challenges that affect its performance and propose comprehensive solutions to overcome them [10,11].”
Transformer Autoencoder for K-means Efficient clustering
Wu, W., Wang, W., Jia, X., & Feng, X. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.108612 · Cited by 51
Liu, X., Zu, L., Wei, Z., Wang, Y., Pan, Z., Xiao, G., & Jenkins, N. (2024) · International Journal of Hydrogen Energy · doi:10.1016/j.ijhydene.2024.07.415 · Cited by 51
“After receiving the annual time series curves, the yearly time series data are clustered using the K-means clustering method with day as the basic clustering unit to get the typical day series [37].”
Comparison of tabular synthetic data generation techniques using propensity and cluster log metric
Pathare, A. A., Mangrulkar, R., Suvarna, K., Parekh, A., Thakur, G., & Gawade, A. U. (2023) · International Journal of Information Management Data Insights · doi:10.1016/j.jjimei.2023.100177 · Cited by 64
Xue, R., Zhang, C., Yan, H., Li, J., Ren, J., Akhlaq, M., Hameed, M. U., & Disasa, K. N. (2023) · Agronomy · doi:10.3390/agronomy13112798 · Cited by 50
Imbalanced Data Classification Based on Improved Random-SMOTE and Feature Standard Deviation
Zhang, Y., Deng, L., & Wei, B. (2024) · Mathematics · doi:10.3390/math12111709 · Cited by 55
Ge, Y., Song, S., Yu, S., Zhang, X., & Li, X. (2024) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2024.108776 · Cited by 48
Ramadhan, N. G., Adiwijaya, A., Maharani, W., & Gozali, A. A. (2024) · IEEE Access · doi:10.1109/access.2024.3406748 · Cited by 54
A two-step deep learning-based framework for metro tunnel lining defect recognition
Feng, Y., Feng, S., Zhang, X.-L., Zhang, X.-L., & Zhao, Y. (2024) · Tunnelling and Underground Space Technology · doi:10.1016/j.tust.2024.105832 · Cited by 48
Rodríguez, A., Chen, Y., & Argueta, C. (2022) · IEEE Access · doi:10.1109/access.2022.3151098 · Cited by 48
Traffic Engineering in Hybrid Software Defined Network via Reinforcement Learning
Guo, Y., Wang, W., Zhang, H., Guo, W., Wang, Z., Tian, Y., Yin, X., & Wu, J. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2021.103116 · Cited by 47
Yan, Z., & Li, Y. (2023) · Ocean Engineering · doi:10.1016/j.oceaneng.2023.114912 · Cited by 47
Altham, C., Zhang, H.-Z., & Pereira, E. (2024) · PLoS ONE · doi:10.1371/journal.pone.0303644 · Cited by 43
“K-Means is computationally efficient and suitable for scenarios with roughly spherical and equally sized clusters [90, 91].”
Robazzi, J. V. S., Derman, İ. D., Gupta, D., Haugh, L., Singh, Y. P., Pal, V., Yilmaz, Y. O., Liu, S., Dias, A. L., Flauzino, R. A., et al. (2025) · Advanced Functional Materials · doi:10.1002/adfm.202509530 · Cited by 57
FRCM: A fuzzy rough c-means clustering method
Yu, B., Zheng, Z., Cai, M., Witold Pedrycz, C., & Ding, W. (2024) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2024.108860 · Cited by 46
Smart city and sustainability indicators: a bibliometric literature review
Tomadon, L. D. S., do Couto, E. V., de Vries, W. T., & Moretto, Y. (2024) · Discover Sustainability · doi:10.1007/s43621-024-00328-w · Cited by 50
“In an ideal clustering scenario, each cluster comprises similar data instances that are significantly different from instances in other clusters [40].”
The Geometry of Concepts: Sparse Autoencoder Feature Structure
Li, Y., Michaud, E. J., Baek, D. D., Engels, J., Sun, X., & Tegmark, M. (2025) · Entropy · doi:10.3390/e27040344 · Cited by 80
“A 3-lobe partition (right) is seen to mainly subdivide the English lobe into a part for short messages and dialogue (e.g. chat rooms and parliament proceedings) and one primarily containing long-form scientific papers.”
Analisis Klaster Kinerja Usaha Kecil dan Menengah Menggunakan Algoritma K-Means Clustering
Marcelina, D., Kurnia, A., & Terttiaavini, T. (2023) · MALCOM Indonesian Journal of Machine Learning and Computer Science · doi:10.57152/malcom.v3i2.952 · Cited by 44
Cataldo, A., Criscuolo, S., Benedetto, E. D., Masciullo, A., Pesola, M., Picone, J., & Schiavoni, R. (2023) · Measurement · doi:10.1016/j.measurement.2023.114040 · Cited by 44
Environmental and Economic Clustering of Indonesian Provinces: Insights from K-Means Analysis
Noviandy, T. R., Hardi, I., Zahriah, Z., Sofyan, R., Sasmita, N. R., Hilal, I. S., & Idroes, G. M. (2024) · Leuser Journal of Environmental Studies · doi:10.60084/ljes.v2i1.181 · Cited by 43
Mei, Q., Zhang, Z., Han, J., Song, J., Dong, J., Wu, H., Xu, J., & Tao, F. (2024) · Earth system science data · doi:10.5194/essd-16-3213-2024 · Cited by 43
Has the educational use of digital technologies changed after the pandemic? A longitudinal study
Pozo, J. I., Cabellos, B., & Echeverría, M. D. P. P. (2024) · PLoS ONE · doi:10.1371/journal.pone.0311695 · Cited by 43
Customer Segmentation Using Machine Learning Model: An Application of RFM Analysis
Lewaaelhamd, I. (2023) · Journal of Data Science and Intelligent Systems · doi:10.47852/bonviewjdsis32021293 · Cited by 42
Li, W., Yang, F., Wang, F., Rong, Y., Liu, L., Wu, B., Zhang, H., & Yao, J. (2024) · Nature Methods · doi:10.1038/s41592-024-02214-9 · Cited by 48
“We utilized the k -means algorithm 46 to obtain the cell clusters.”
Investigating the impact of data scaling on the k-nearest neighbor algorithm
Pagan, M., Zarlis, M., & Candra, A. (2023) · Computer Science and Information Technologies · doi:10.11591/csit.v4i2.p135-142 · Cited by 42
Zhou, S., Yang, D., Zhang, Z., Zhang, J., Qu, F., Punetha, P., Li, W., & Li, N. (2024) · Measurement · doi:10.1016/j.measurement.2024.115603 · Cited by 42
Machine Learning in Healthcare Analytics: A State-of-the-Art Review
Das, S., Nayak, S. P., Sahoo, B., & Nayak, S. C. (2024) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-024-10098-3 · Cited by 57
“Reducing the total squared distance between each data point and the designated cluster centroids is the aim [130].”
Miao, D., Wang, W., Lv, Y., Liu, L., Yao, K., & Sui, X. (2023) · International Journal of Industrial Ergonomics · doi:10.1016/j.ergon.2023.103481 · Cited by 38
Chen, Y., Tan, P., Li, M., Yin, H., & Tang, R. (2024) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2024.110165 · Cited by 38
Automated Detection of Nonmelanoma Skin Cancer Based on Deep Convolutional Neural Network
Arif, M., Philip, F. M., Ajesh, F., Izdrui, D., Crăciun, M. D., & Geman, O. (2022) · Journal of Healthcare Engineering · doi:10.1155/2022/6952304 · Cited by 38
RetractedKhaliq, F., Mahajani, S. U., Oberhauser, J., & Wakhloo, D. (2022) · Neural Regeneration Research · doi:10.4103/1673-5374.355982 · Cited by 38
“…the simplest unsupervised ML algorithms, the K-means method represents a popular clustering algorithm used to divide a given dataset between a pre-determined number of clusters (k) based on recognized similarities and dissimilarities between data points (Raval and Jani, 2016; Ahmed et al., 2020).”
BackgroundMethodJin, L., Du, Z., Shu, L., Cen, Y., Xu, Y., Mei, Y., & Zhang, H. (2025) · Nature Communications · doi:10.1038/s41467-025-56481-x · Cited by 37
An Obstacle-Finding Approach for Autonomous Mobile Robots Using 2D LiDAR Data
Mochurad, L., Hladun, Y., & Tkachenko, R. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7010043 · Cited by 37
Forecasting hotel cancellations through machine learning
Herrera, A., Arroyo, Á., Jiménez, A., & Herrero, Á. (2024) · Expert Systems · doi:10.1111/exsy.13608 · Cited by 42
“The goal of k -means is to define the centroid and members of each cluster by minimizing the distance from each point to the cluster centroid, a process that is repeated until the centroid does not change significantly (Ahmed et al., 2020).”
Hwang, S. H., Song, J. Y., Ryu, H. I., Oh, J. H., Lee, S.-W., Lee, D., Park, D. Y., & Park, S. M. (2023) · Advanced Fiber Materials · doi:10.1007/s42765-022-00247-3 · Cited by 36
“Unsupervised learning algorithms such as K-means [22], hierarchical cluster analysis (HCA), and t-distributed stochastic neighbor embedding (t-SNE) [23] have been used to cluster data with similarity, pattern, and difference without labeled output data (i.e., with only input data).”
MethodYılmaz, İ., Adem, A., & Dağdeviren, M. (2023) · Journal of Energy Storage · doi:10.1016/j.est.2023.107941 · Cited by 36
Šofer, M., Šofer, P., Pagáč, M., Volodarskaja, A., Babiuch, M., & Gruň, F. (2022) · Polymers · doi:10.3390/polym15010047 · Cited by 35
“The most used approach is the k-means clustering technique [15,23,25] and its derivatives, such as k-medoid, fuzzy k-means, genetic kmeans, or k-means++ [32,46], which may be combined with other techniques such as SOM, competitive neural networks [34], or PCA [32].”
MethodAkinsoji, A. H., Adelodun, B., Adeyi, Q., Salau, R. A., Odey, G., & Choi, K. S. (2024) · Water Resources Management · doi:10.1007/s11269-024-03885-x · Cited by 35
Deep clustering using 3D attention convolutional autoencoder for hyperspectral image analysis
Zheng, Z., Zhang, S., Song, H., & Yan, Q. (2024) · Scientific Reports · doi:10.1038/s41598-024-54547-2 · Cited by 37
“The K-means algorithm 26 organizes samples by iteratively computing the distance between each sample and the cluster center.”
MethodClimate Classification for Major Cities in China Using Cluster Analysis
Duan, H., Li, Q., He, L., Zhang, J., An, H., Ali, R., & Vazifedoust, M. (2024) · Atmosphere · doi:10.3390/atmos15070741 · Cited by 34
Li, G., Shi, G., & Jiao, J. (2023) · Sensors · doi:10.3390/s23115242 · Cited by 33
“YOLOv5 uses K-means clustering [36] to determine prior anchor boxes.”
MethodWilbert, H. J., Hoppe, A. F., Sartori, A., Stefenon, S. F., Silva, L. A., & Leithardt, V. R. Q. (2023) · Algorithms · doi:10.3390/a16090396 · Cited by 36
Machine Vision Applications for Welfare Monitoring in Aquaculture: Challenges and Opportunities
Fitzgerald, A., Ioannou, C. C., Consuegra, S., Dowsey, A. W., & de Leániz, C. G. (2025) · Aquaculture Fish and Fisheries · doi:10.1002/aff2.70036 · Cited by 45
Kim, S., Jeong, K., Hong, T., Lee, J., & Lee, J. (2023) · Journal of Management in Engineering · doi:10.1061/jmenea.meeng-5143 · Cited by 40
Ishaque, S., Khan, N., & Krishnan, S. (2023) · Bioengineering · doi:10.3390/bioengineering10070766 · Cited by 33
“Originally, the K-means algorithm was used as an clustering algorithm, which partitions data based on similar clusters, to discover similarities within the data and predict anomalies without any labels [22].”
MethodA Comprehensive Survey on Knowledge-Defined Networking
Wijesekara, P. A. D. S. N., & Gunawardena, S. (2023) · Telecom · doi:10.3390/telecom4030025 · Cited by 46
Data Analysis in Factors of Social Entrepreneurship Tools in Complex Thinking: An exploratory study
Ibarra-Vázquez, G., Soledad, M., & Miranda, J. (2023) · Thinking Skills and Creativity · doi:10.1016/j.tsc.2023.101381 · Cited by 33
A data-driven clustering approach for assessing spatiotemporal vulnerability to urban emergencies
Bittencourt, J. C. N., Costa, D. G., Portugal, P., & Vasques, F. (2024) · Sustainable Cities and Society · doi:10.1016/j.scs.2024.105477 · Cited by 32
FG-SAT: Efficient Flow Graph for Encrypted Traffic Classification Under Environment Shifts
Cui, S., Han, X., Han, D., Wang, Z., Wang, W., Jiang, B., Liu, B., & Lü, Z. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3571663 · Cited by 35
“For instance, under the content shift of “browsing” tra ffi c, K-means [44] clustering is performed on the tra ffi c of two groups of content, the cluster centroid is obtained, and then the Euclidean distance of the data packet to the centroid is calculated.”
Li, F., Fan, Z., Cao, B., & Li, X. (2020) · Sustainability · doi:10.3390/su13010284 · Cited by 32
Cui, W., Ma, Y., Ren, J., Liu, J., Ma, G., Liu, H., & Li, Y. (2023) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2023.3271062 · Cited by 32
“Then, to get a fine-grained parcellation, we employ a k -means clustering approach on the group-averaged FC networks to parcellate the cortical vertexes into 213 functional ROIs [25].”
Environment Reconstruction Based on Multi-User Selection and Multi-Modal Fusion in ISAC
Lin, B., Zhao, C., Gao, F., Li, G. Y., Qian, J., & Wang, H. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3424849 · Cited by 31
“Specifically, we use the K-Means algorithm in [33] to cluster the points in P and then fit a surface to the points in each cluster.”
MethodUfeli, C. P., Sattar, M. U., Hasan, R., & Mahmood, S. (2025) · Information · doi:10.3390/info16060441 · Cited by 38
Bobadilla, J., Gutiérrez, A., Yera, R., & Martínez, L. M. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.111016 · Cited by 37
LE‐YOLOv5: A Lightweight and Efficient Road Damage Detection Algorithm Based on Improved YOLOv5
Diao, Z., Huang, X., Liu, H., & Liu, Z. (2023) · International Journal of Intelligent Systems · doi:10.1155/2023/8879622 · Cited by 31
Chandrashekar, K. S., Niranjan, V., Vishal, A., & Setlur, A. S. (2024) · Current Bioinformatics · doi:10.2174/0115748936284044240108074937 · Cited by 30
Qian, H., Geng, Y., & Wang, H. (2024) · Geoenergy Science and Engineering · doi:10.1016/j.geoen.2024.213036 · Cited by 30
Prediction of Seawater Intrusion Run-Up Distance Based on K-Means Clustering and ANN Model
Li, J., Meng, Z., Zhang, J., Chen, Y., Yao, J., Li, X., Peng, Q., Liu, X., & Cheng, C. (2025) · Journal of Marine Science and Engineering · doi:10.3390/jmse13020377 · Cited by 30
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
- gold
- doi.org
- Licence
- 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.

![Figure 2 Refined initial instances, adapted from [54].](https://figures.cochat.ai/paper-figures/086dc224b1ec454cbfe3d4e28cabc857/the-k-means-algorithm-a-comprehensive-survey-and-performance-evaluation-figure-2.png)

