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
Items 201–300 of 1,001
Pishro, A. A., Zhang, S., L’Hostis, A., Liu, Y., Hu, Q., Hejazi, F., Shahpasand, M., Rahman, A., Oueslati, A., & Zhang, Z. (2024) · Scientific Reports · doi:10.1038/s41598-024-75541-8 · Cited by 16
“The K-Means represents a prototyping-based clustering algorithm 4,5 .”
MethodLow-light image enhancement via Clustering Contrastive Learning for visual recognition
Sheng, G., Hu, G. Y., Wang, X., Chen, W., & Jiang, J. (2025) · Pattern Recognition · doi:10.1016/j.patcog.2025.111554 · Cited by 18
Alcaras, E., Amoroso, P. P., Figliomeni, F. G., Parente, C., & Vallario, A. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-17439-1_27 · Cited by 17
Clustering-based model predictive control of solar parabolic trough plants
Chanfreut, P., Maestre, J. M., Gallego, A. J., Annaswamy, A. M., & Camacho, E. F. (2023) · Renewable Energy · doi:10.1016/j.renene.2023.118978 · Cited by 19
Walker, S. S. W., Bergkamp, V., Yang, D., van Goch, T. A. J., Katić, K., & Zeiler, W. (2021) · Energy · doi:10.1016/j.energy.2021.120711 · Cited by 16
“This is a limitation [34] of this method.”
MethodSukumaran, A., & Abraham, A. (2021) · Axioms · doi:10.3390/axioms11010015 · Cited by 16
Prototype learning based hierarchical decoupling for multimodal recommendation
Liu, J., Zhang, Y., He, Q., Ran, Y., Wang, X., & Zhou, W. G. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.130763 · Cited by 15
Ganguly, A., Oza, H., Padhya, V., Pandey, A., Chakra, S., & Deshpande, R. D. (2023) · Scientific Reports · doi:10.1038/s41598-023-27577-5 · Cited by 15
Post-Disaster Area Monitoring with Swarm UAV Systems for Effective Search and Rescue
Bakırcı, M., & Özer, M. M. (2023) · International Conference on Recent Advances in Space Technologies · doi:10.1109/rast57548.2023.10198022 · Cited by 15
HCSD-Net: Single Image Desnowing with Color Space Transformation
Zhang, T., Jiang, N., Wu, H., Zhang, K., Niu, Y., & Zhao, T. (2023) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3581783.3613789 · Cited by 15
“Subsequently, we cluster the three features of mask image in different color spaces by KMeans clustering method [1], and visualize the distributions through t-SNE method [32].”
MethodPrice-Based Demand Response: A Three-Stage Monthly Time-of-Use Tariff Optimization Model
You, P., Li, S., Li, C., Zhang, C., Zhou, H., Wang, H., Zhao, H., & Zhao, Y. (2023) · Energies · doi:10.3390/en16237858 · Cited by 15
Wang, J., Fan, X., Zhang, Z., Zhang, X., Nie, W., Qi, Y., & Zhang, N. (2024) · Remote Sensing · doi:10.3390/rs16111891 · Cited by 15
Graph Embedding-Based Bayesian Network for Fault Isolation in Complex Equipment
Xia, L., Zheng, P., Herrera, M., Liang, Y., Li, X., & Gao, L. (2024) · IEEE Transactions on Reliability · doi:10.1109/tr.2024.3416064 · Cited by 15
“As such, State-of-the-Art unsupervised learning methods, including K-means [41], Iso-late Forest [42], Variational Autoencoder [43], Birth [44], and Spectral clustering [45], are employed as comparative models.”
Ren, X., Wang, M., Dai, G., Peng, L. J., Chen, X., & Song, Z. (2024) · Information Sciences · doi:10.1016/j.ins.2024.121364 · Cited by 15
Peng, Y., Chen, X., Miao, D., Qin, X., Gu, X., & Lu, P. (2024) · Complex & Intelligent Systems · doi:10.1007/s40747-024-01626-6 · Cited by 15
“It is worth mentioning that recently, Liu et al. [49] optimized the reflection constellation using the K-means [50] algorithm, significantly improving the system’s bit error performance.”
A Hybrid K-Means++ and Particle Swarm Optimization Approach for Enhanced Document Clustering
Hassan, E., Malik, F., Khan, Q. W., Ahmad, N., Sardaraz, M., Karim, F. K., & Elmannai, H. (2025) · IEEE Access · doi:10.1109/access.2025.3535226 · Cited by 15
“K-Means, despite being commonly used for clustering, the algorithm has certain drawbacks, including problems associated with random initialization of the centroids, which leads to inconsistent results and unexpected convergence [50].”
Iraqi Commission for Computers & Informatics, Ali, A. M., & Mohammed, M. A. (2024) · Journal of Soft Computing and Data Mining · doi:10.30880/jscdm.2024.05.02.017 · Cited by 27
Machine learning techniques for agricultural image recognition
Keyvanpour, M. R., & Shirzad, M. B. (2022) · Elsevier eBooks · doi:10.1016/b978-0-323-90550-3.00011-4 · Cited by 15
Alcaras, E., Amoroso, P. P., Figliomeni, F. G., Parente, C., & Prezioso, G. (2022) · The international archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences · doi:10.5194/isprs-archives-xlviii-4-w3-2022-13-2022 · Cited by 15
Rasera, G. B., Araújo, É. D. V., Pereira, A. K., Liszbinski, R. B., Pacheco, G., Fill, T. P., de Jesus, M. B., & de Castro, R. J. S. (2023) · Food Research International · doi:10.1016/j.foodres.2023.112881 · Cited by 15
A new scenario framework for equitable and climate-compatible futures
Ranjan, A., Kanitkar, T., & Jayaraman, T. (2024) · Climate and Development · doi:10.1080/17565529.2024.2365939 · Cited by 15
“It is easier to interpret, and more efficient in handling datasets with multiple variables due to its linear time complexity with respect to the number of data points (Ahmed et al., 2020; Bahmani et al., 2011).”
Multiscale Convolutional Mask Network for Hyperspectral Unmixing
Xu, M., Xu, J. C., Liu, S., Sheng, H., & Yang, Z. (2024) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2024.3352080 · Cited by 17
“Hong et al. [32] used K-means [36] for the VCA results to obtain spectral bundles for the subsequent endmember guidance network.”
MethodComparison of K-Means, BIRCH and Hierarchical Clustering Algorithms in Clustering OCD Symptom Data
Rizalde, A. R., Mubarak, H. A., Ramadhan, G., & Fatan, M. A. (2024) · Public Research Journal of Engineering Data Technology and Computer Science · doi:10.57152/predatecs.v1i2.1106 · Cited by 14
Personalized Elastic Embedding Learning for On-Device Recommendation
Zheng, R., Qu, L., Chen, T., Zheng, K., Shi, Y., & Yin, H. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3361562 · Cited by 21
“Therefore, Given a set of user embeddings, we utilize K -Means [58] to divide users into set u } to minimize the within-cluster variance: where μ i is the mean of embeddings in User-item data instances ( u i , v j ) will be used for learning within the user group U G u , only when the user belongs…”
MethodXu, D., Ding, C.-Y., Liu, Y., Sun, J., Peng, W. J., & Zhang, D. (2024) · steel research international · doi:10.1002/srin.202300736 · Cited by 14
Log2Graph: A graph convolution neural network based method for insider threat detection
Fei, K., Zhou, J., Su, L., Wang, W., & Chen, Y. (2024) · Journal of Computer Security · doi:10.3233/jcs-230092 · Cited by 15
“We first compare the Log2Graph with baselines, including Kmeans [1], IF (Isolation Forest) [26], and GCN [20].”
Ding, T., Zhao, W., & Yang, Y. (2024) · International Journal of Applied Earth Observation and Geoinformation · doi:10.1016/j.jag.2024.104003 · Cited by 19
Cluster-guided denoising graph auto-encoder for enhanced traffic data imputation and fault detection
Huang, Y., Zhen, H., & Yang, J. J. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125531 · Cited by 14
Identify and map coastal aquaculture ponds and their drainage and impoundment dynamics
Wang, D., Mao, D., Wang, M., Xiao, X., Choi, C., Huang, C., & Wang, Z. (2024) · International Journal of Applied Earth Observation and Geoinformation · doi:10.1016/j.jag.2024.104246 · Cited by 23
ASDroid: Resisting Evolving Android Malware With API Clusters Derived From Source Code
Hu, Q., Wang, W., Song, H. T., Guo, S., Zhang, J., & Zhang, S. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3536280 · Cited by 14
“Previous studies [6], [7] often employs Kmeans [36] to cluster API semantic vectors, but the selection of the initial centroid in the Kmeans algorithm has a great impact on the final clustering result, potentially resulting in an unstable feature set.”
Li, Y., Xu, Y., Li, W., Li, G., Feng, Z., Liu, S., Du, J., & Li, X. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3552297 · Cited by 14
“In comparison with [31], which employs a deep deterministic policy gradient (DDPG) framework for real-time power control and unlike the scenario delineated in the referenced paper, where k-means [32] clustering is employed to tackle positioning problems in an alternate dimension.”
Advancing Image Compression Through Clustering Techniques: A Comprehensive Analysis
Omari, M., Kaddi, M., Salameh, K., & Alnoman, A. A. (2025) · Technologies · doi:10.3390/technologies13030123 · Cited by 14
Self-Supervised Graph Masked Autoencoders for Hyperspectral Image Classification
Hu, Z., Tu, B., Liu, B., He, Y., Li, J., & Plaza, A. (2025) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2025.3555967 · Cited by 20
“The methods selected include K -Means [54], RCN [55], HSIMAE [56], and our proposed SGMAE.”
Contreras, R. C., Viana, M. S., Bernardino, V. J. S., dos Santos, F. L., Toygar, Ö., & Guido, R. C. (2025) · Scientific Reports · doi:10.1038/s41598-025-97708-7 · Cited by 14
RetractedComparing satellite and BGC-Argo chlorophyll estimation: A phenological study
Baudena, A., Riom, W., Taillandier, V., Mayot, N., Mignot, A., & D’Ortenzio, F. (2025) · Remote Sensing of Environment · doi:10.1016/j.rse.2025.114743 · Cited by 14
“To this aim, we use the 𝑘 -means method (Hartigan and Wong, 1979; Ahmed et al., 2020), chosen as it has already been successfully applied to a variety of case studies including clustering of time series of satellite CHL (D’Ortenzio and Ribera d’Alcalà, 2009; Marchese et al., 2019; Mayot et al.,…”
Brain tumor image segmentation using K-means and fuzzy C-means clustering
Bhardwaj, M., Khan, N. U., Baghel, V., Vishwakarma, S. K., & Bashar, A. (2023) · Elsevier eBooks · doi:10.1016/b978-0-32-398370-9.00020-2 · Cited by 14
K-Means and J48 Algorithms to Categorize Student Research Abstracts
Choi, L. K., Rii, K. B., & Park, H. W. (2023) · International Journal of Cyber and IT Service Management · doi:10.34306/ijcitsm.v3i1.125 · Cited by 14
Abboush, M., Knieke, C., & Rausch, A. (2023) · Sensors · doi:10.3390/s23146606 · Cited by 18
“Thus, the hidden patterns can be extracted from the data without any knowledge of the true labels. k-means k-means clustering has achieved remarkable success in addressing various technical challenges, such as social tags, shape recognition and wireless sensor networks [60].”
BackgroundLuo, Y., Wei, H., & Yang, K. (2023) · The Science of The Total Environment · doi:10.1016/j.scitotenv.2023.168185 · Cited by 14
A Hybrid Intelligent Modeling approach for predicting the solar thermal panel energy production
Arroyo, Á., Basurto, N., Vara, R. C., Timiraos, M., & ROLLE, J. L. C. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.126997 · Cited by 14
Sasmita, N. R., Khairul, M., Sofyan, H., Kruba, R., Mardalena, S., Dahlawy, A., Apriliansyah, F., Muliadi, M., Saputra, D. C. E., Noviandy, T. R., et al. (2023) · Infolitika Journal of Data Science · doi:10.60084/ijds.v1i2.130 · Cited by 14
Hashemian, F., Maleki, N., & Zeinali, Y. (2024) · Services Marketing Quarterly · doi:10.1080/15332969.2024.2313873 · Cited by 20
“Its simplicity, efficiency, and ease of implementation make it a fundamental technique in the domain of unsupervised machine learning (Ahmed et al., 2020).”
BackgroundThe Geometry of Concepts: Sparse Autoencoder Feature Structure
Li, Y., Michaud, E. J., Baek, D. D., Engels, J., Sun, X., & Tegmark, M. (2024) · arXiv · doi:10.48550/arxiv.2410.19750 · Cited by 14
“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.”
Constantin, A. M., Voica, O., Silvestru, C. I., Icociu, V.-C., Silvestru, R.-C., & Grecu, A. (2023) · Sustainability · doi:10.3390/su152416924 · Cited by 13
Cui, J., Li, H., He, Q., Jin, B., Liu, Z., Zhang, X., & Zhang, L. (2024) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2024.108113 · Cited by 13
Mele, M., Mele, A., Imbrici, P., Samarelli, F., Purgatorio, R., Dinoi, G., Correale, M., Nicolotti, O., Luca, A. D., Brunetti, N. D., et al. (2024) · Molecules · doi:10.3390/molecules29112651 · Cited by 13
Muravyov, S. V., & Nguyen, D. C. (2024) · Measurement · doi:10.1016/j.measurement.2024.114969 · Cited by 13
Artificial Intelligence in Diagnostic Medical Image Processing for Advanced Healthcare Applications
Kalita, A. J., Boruah, A., Das, T., Mazumder, N., Jaiswal, S. K., Zhuo, G., Gogoi, A., Kakoty, N. M., & Kao, F. (2024) · Biological and medical physics, biomedical engineering · doi:10.1007/978-981-97-5345-1_1 · Cited by 23
de Ramos, D. C., Ferreira, L. R., Santos, M. M. D., Teixeira, E. L. S., Yoshioka, L. R., Justo, J. F., & Malik, A. W. (2024) · Sensors · doi:10.3390/s24227219 · Cited by 15
“K-Means is widely used due to its simple and fast-converging algorithm [32].”
Zhao, X., Guo, Y., & Wang, Y. (2024) · Ocean Engineering · doi:10.1016/j.oceaneng.2024.120138 · Cited by 13
IMPLEMENTASI MACHINE LEARNING DALAM PENGELOMPOKAN MUSIK MENGGUNAKAN ALGORITMA K-MEANS CLUSTERING
Hakim, B., Kaunang, F. J., Susanto, C., Salim, J., & Indradjaja, R. (2025) · IDEALIS : InDonEsiA journaL Information System · doi:10.36080/idealis.v8i1.3357 · Cited by 13
Towards net zero: How determinants of energy transition shape sustainable future
Singhania, M., & Gupta, D. (2025) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2025.146561 · Cited by 14
Zaręba, M., & Danek, T. (2025) · Ecological Informatics · doi:10.1016/j.ecoinf.2025.103450 · Cited by 13
KNN-MMD: Cross Domain Wireless Sensing via Local Distribution Alignment
Zhao, Z., Cai, Z., Chen, T., Li, X., Li, H., Chen, Q., & Zhu, G. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3644902 · Cited by 13
Adaptive Covers for Mapper Graphs Using Information Criteria
Chalapathi, N., Zhou, Y., & Wang, B. (2021) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata52589.2021.9671324 · Cited by 13
“X-means algorithm was proposed to address both the scalability and the parameter selection issues of the k-means algorithm for large datasets [53].”
MethodBest Practices in Knowledge Transfer: Insights from Top Universities
Loiotile, A. D., Nicolò, F. D., Agrimi, A., Bellantuono, L., Rocca, M. L., Monaco, A., Pantaleo, E., Tangaro, S., Amoroso, N., & Bellotti, R. (2022) · Sustainability · doi:10.3390/su142215427 · Cited by 15
Mu, S., Li, A. (., Shen, L., Han, L., & Wen, Z. (2023) · Sustainability · doi:10.3390/su15032194 · Cited by 13
Delineation and detection of breast cancer using novel label-free fluorescence
Mahmoud, A., & El-Sharkawy, Y. H. (2023) · BMC Medical Imaging · doi:10.1186/s12880-023-01095-2 · Cited by 13
“(2) and (3) [47, 48].”
4AC-YOLOv5: an improved algorithm for small target face detection
Jiang, B., Jiang, H., Zhang, H., Zhang, Q., Li, Z., & Huang, L. (2024) · EURASIP Journal on Image and Video Processing · doi:10.1186/s13640-024-00625-4 · Cited by 14
“…frame may not match the size of the target object, the small target may lead to missing or false detection, K-means clustering algo-109 rithm [25] is added to regenerate 12 different preset anchor frame sizes for the four detection layers, which can better adapt to the requirements of…”
BackgroundKim, H. H., Lim, Y., Seo, S. I., Lee, K. J., Kim, J., & Shin, W. G. (2021) · Applied Sciences · doi:10.3390/app11136194 · Cited by 13
“Furthermore, it detects high-risk patients who have a high probability of progressing to gastric cancer using K-means clustering [23].”
BackgroundAnalysis K-Nearest Neighbor Method in Classification of Vegetable Quality Based on Color
Putra, P. H., Novelan, M. S., & Rizki, M. (2022) · Journal of Applied Engineering and Technological Science (JAETS) · doi:10.37385/jaets.v3i2.763 · Cited by 13
Yuan, L., Zhang, T., Chen, Y., Yang, Y., & Huang, L. (2024) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2023.046907 · Cited by 12
A Novel Classification Model Based on Hybrid K-Means and Neural Network for Classification Problems
Chenghu, C., & Thammano, A. (2024) · HighTech and Innovation Journal · doi:10.28991/hij-2024-05-03-012 · Cited by 12
He, C., Wood, N., Bugdayci, N. B., & Okwudire, C. E. (2024) · Journal of Manufacturing Science and Engineering · doi:10.1115/1.4066977 · Cited by 12
Decision-Making Model for Life Cycle Management of Aircraft Components
Kabashkin, I., & Susanin, V. (2024) · Mathematics · doi:10.3390/math12223549 · Cited by 13
Topicwise Separable Sentence Retrieval for Medical Report Generation
Zhao, J., Yang, Z., Chen, Z., Fu, H., & Wan, L. (2024) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2024.3507076 · Cited by 12
“Next, we apply the K-Means algorithm [35], [36] to cluster these sentence embeddings.”
MethodLi, Y., Ren, Z., Zhao, C., & Liang, G. (2025) · Foods · doi:10.3390/foods14030484 · Cited by 12
“To achieve be tt er traceability accuracy, it is necessary to pre-process the raw spectra.”
Automated Seeding in Hydroponic Greenhouse With a Dual-Arm Robotic System
Rodríguez-Nieto, D., Navas, E., & Fernández, R. (2025) · IEEE Access · doi:10.1109/access.2025.3541954 · Cited by 12
“The K-means method [41] is then applied to the masked image after it is converted to the L*a*b color space.”
Efficient and Deployable Knowledge Infusion for Open-World Recommendations via Large Language Models
Xi, Y., Liu, W., Lin, J., Weng, M., Cai, X., Zhu, H. C., Zhu, J., Chen, B., Tang, R., Yu, Y. H., et al. (2025) · ACM Transactions on Recommender Systems · doi:10.1145/3725894 · Cited by 14
Imane, B., Alae, A., Khaissidi, G., & Mrabti, M. (2025) · Discover Applied Sciences · doi:10.1007/s42452-025-06952-z · Cited by 14
“It is an iterative algorithm that takes an initial dataset of word images as input and, in each iteration, applies a calculated number of augmentations to each image based on character frequency clusters determined using K-means [60] (the formula is described in Algorithm 1).”
Wang, Y., Yuan, Y., Yuan, F., Liu, X., Tian, Y., Zhu, Y. P., Cao, W., & Cao, Q. (2025) · Precision Agriculture · doi:10.1007/s11119-025-10265-x · Cited by 12
“K-means clustering is a popular and straightforward algorithm used in data analysis and machine learning to divide a given dataset into K distinct, non-overlapping clusters (Ahmed et al., 2020).”
Yu, H., Chen, X., Gu, X., Yang, Y., Qiu, H., & Zhang, L. (2025) · Sustainable Cities and Society · doi:10.1016/j.scs.2025.106635 · Cited by 12
Data-Driven Recursive Kinetic Modeling for Fenton Reaction
Hua, T.-W., Huang, G., Qian, C., Zeng, H.-W., Jiang, J., & Yu, H. (2025) · Environmental Science & Technology · doi:10.1021/acs.est.5c06048 · Cited by 12
Knowledge Discovery: Can It Shed New Light on Threshold Definition for Heavy-Hitter Detection?
Pekár, A., Duque‐Torres, A., Seah, W. K. G., & Rendón, O. M. C. (2021) · Journal of Network and Systems Management · doi:10.1007/s10922-021-09593-w · Cited by 13
“Several K-means algorithms exist [57].”
The Impact of COVID-19 on Pedestrian Flow Patterns in Urban POIs—An Example from Beijing
Li, Y., & Xu, L. (2021) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi10070479 · Cited by 13
“The clustering method used was K-means clustering [34].”
MethodDensity-clustering of continuous gravitational wave candidates from large surveys
Steltner, B., Menne, T., Papa, M. A., & Eggenstein, H.-B. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.104063 · Cited by 12
“For example k -means [20], is a clustering method widely used in a variety of applications including signal-, image- and text-processing, health, cyber security, machine learning and big data [21].”
MethodClustering Panjang Ruas Jalan di BBPJN Sumut Menggunakan Algoritma K-Means
Rosadi, M., Nurhasanah, D. A., & Hasibuan, M. S. (2023) · Journal of Computer Science and Informatics Engineering (CoSIE) · doi:10.55537/cosie.v2i1.567 · Cited by 12
A stochastic framework for computationally efficient fail-safe topology optimization
Zhang, Y., Zhang, H., Qiu, L., Wang, Z., Zhang, S., Qiu, N., & Fang, J. (2023) · Engineering Structures · doi:10.1016/j.engstruct.2023.115831 · Cited by 12
Combination of genetic algorithms and K-means for a hybrid topic modeling: tourism use case
Bouabdallaoui, I., Guerouate, F., & Sbihi, M. (2023) · Evolutionary Intelligence · doi:10.1007/s12065-023-00863-x · Cited by 14
“Lastly, the final stack of layers is utilized [30].”
Enhancing EEG-based attachment style prediction: unveiling the impact of feature domains
Laufer, I., Mizrahi, D., & Zuckerman, I. (2024) · Frontiers in Psychology · doi:10.3389/fpsyg.2024.1326791 · Cited by 13
“To avoid arbitrary thresholds for classifying these attachment types, we utilized the k-means clustering algorithm (Ahmed et al., 2020) to objectively determine natural groupings in our dataset.”
MethodHu, J., Yang, H., He, J., Bai, D., & Chen, H. (2024) · IEEE Access · doi:10.1109/access.2024.3412425 · Cited by 12
“Although the traditional K-means clustering algorithm [23] performs well in adapting to the distribution of target sizes in datasets, its random selection of initial positions may lead to variability and instability in clustering results.”
MethodSelf-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering
Kazakovtsev, L. A., Павлович, Р. И., Popov, A., & Tovbis, E. (2020) · Computation · doi:10.3390/computation8040090 · Cited by 12
“The simplicity of Lloyd’s procedure enables us to apply it to a wide range of problems, includingface detection, image segmentation, signal processing and many others [92].”
MethodMwakapesa, D. S., Mao, Y., Lan, X., & Nanehkaran, Y. A. (2023) · Sustainability · doi:10.3390/su15054218 · Cited by 12
Auto Insurance Pricing Using Telematics Data: Application of a Hidden Markov Model
Jiang, Q., & Shi, T. (2024) · North American Actuarial Journal · doi:10.1080/10920277.2023.2285977 · Cited by 14
“Despite its popularity, the K -means algorithm has some limitations (Ahmed, Seraj, and Islam 2020).”
Li, M., & Wang, T. (2023) · Education and Information Technologies · doi:10.1007/s10639-023-12078-9 · Cited by 11
“…algorithms used for comparison and analysis were DBSCAN(Density-Based Spatial Clustering of Applications with Noise) (Ester et al., 1996), support vector clustering (Ben-Hur et al., 2001), hierarchical clustering (Defays, 1977), k-means (Ahmed et al., 2020) and x-means (Pelleg & Moore, 2000).”
Santana, D. C., de Oliveira, I. C., de Oliveira, J. L. G., Baio, F. H. R., Teodoro, L. P. R., da Silva, C. A., Seron, A. C. D. S. C., Ítavo, L. C. V., Coradi, P. C., & Teodoro, P. E. (2024) · Spectrochimica Acta Part A Molecular and Biomolecular Spectroscopy · doi:10.1016/j.saa.2024.123963 · Cited by 11
Tamburro, G., Bruña, R., Fiedler, P., Fano, A. D., Raeisi, K., Khazaei, M., Zappasodi, F., & Comani, S. (2024) · Sensors · doi:10.3390/s24102995 · Cited by 12
“REVIEW 10 of 23 The k-means algorithm [60,61] was applied to each group of connectivity vectors to identify characteristic functional maps of cooperation and competition in the three frequency bands.”
MethodInfluentialThongnim, P., Sreekajon, J., & Pukseng, T. (2024) · International Conference on Big Data Analytics and Practices (IBDAP) · doi:10.1109/ibdap62940.2024.10689710 · Cited by 11
“For instance, k-means can divide a farm into zones with similar production needs enhancing resource efficiency [12], [13].”
BackgroundVehicle-based autonomous modal analysis for enhanced bridge health monitoring
Golnary, F., Kalhori, H., Liu, W., & Li, B. (2025) · International Journal of Mechanical Sciences · doi:10.1016/j.ijmecsci.2024.109910 · Cited by 11
Cheng, S., Qu, S., & Zhang, J. (2025) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2025.103066 · Cited by 11
Major Baltic Inflows come in different flavours
Löptien, U., Renz, M., & Dietze, H. (2025) · Communications Earth & Environment · doi:10.1038/s43247-025-02209-0 · Cited by 11
“…atmospheric sea level pressure fi elds from 20 days prior to MBIs until 10 days thereafter using unsupervised learning (k-means clustering method 48,49 with Euclidean distances, calculated in the space/time domain, in combination with dynamic time warping 50,51 ; details are provided in the…”
Wang, Y., Xia, Y., Xu, Q., Wang, J., & Wang, Z. (2025) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2025.130712 · Cited by 11
A data-driven fused kernel density estimator for multi-modal distribution
He, Y., Chen, C.-J., & Jiaqi, C. H. E. N. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.103434 · Cited by 11
HedraRAG: Co-Optimizing Generation and Retrieval for Heterogeneous RAG Workflows
Hu, Z., Murthy, V., Pan, Z., Li, W., Fang, X., Ding, Y., & Wang, Y. (2025) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3731569.3764806 · Cited by 28
Tillage-Depth Verification Based on Machine Learning Algorithms
Pang, J., Zhang, X., Lin, X., Liu, J., Du, X., & Han, J. (2023) · Agriculture · doi:10.3390/agriculture13010130 · Cited by 11
Developing an explainable hybrid deep learning model in digital transformation: an empirical study
Chiu, M., Chiang, Y.-H., & Chiu, J.-E. (2023) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-023-02127-y · Cited by 11
Wang, B., Ma, G., Sui, H., Zhang, Y., Zhang, H., & Zhou, Y. (2023) · Remote Sensing · doi:10.3390/rs15143462 · Cited by 11
Zhai, S., Tan, Y., Zhang, C., Hipolito, C. J., Song, L., Zhu, C., Zhang, Y., Duan, H., & Yin, Y. (2023) · Journal of Medicinal Chemistry · doi:10.1021/acs.jmedchem.3c00627 · Cited by 11
Sun, S., Dong, S., Wu, Q., & Tian, X. (2023) · SAGE Open · doi:10.1177/21582440231196800 · Cited by 11
“After each assignment, the CC of the cluster will be recalculated based on the existing objects in the cluster (Ahmed et al., 2020; Ralambondrainy, 1995).”
MethodService quality dealer identification: the optimization of K-Means clustering
Wella, Y. E., Okfalisa, O., Insani, F., Saeed, F., & Hussin, A. R. C. (2023) · SINERGI · doi:10.22441/sinergi.2023.3.014 · Cited by 11
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)

