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 501–600 of 1,001
Wang, Y., Warder, S. C., Benmoufok, E. F., Wynn, A., Buxton, O. R. H., Staffell, I., & Piggott, M. D. (2026) · Energy Conversion and Management · doi:10.1016/j.enconman.2026.121066 · Cited by 7
“This was achieved using the K-means clustering algorithm, a classical unsupervised learning method that minimizes the within-cluster sum of squared distances between samples and their assigned centroids [45–48].”
Zhong, J., Sabillon-Orellana, C. A., Zhang, M., Ma, Y., Jiang, X., & Huang, B. (2026) · Construction and Building Materials · doi:10.1016/j.conbuildmat.2026.145572 · Cited by 6
Evaluating Sentinel-2 gap filling techniques for cloud removal and data reconstruction
grich, S., Elfarkh, J., Ouaadi, N., Hssaine, B. A., Halim, H., & Chehbouni, A. (2026) · Scientific Reports · doi:10.1038/s41598-026-39488-2 · Cited by 6
Indirect estimation of pediatric reference interval via density graph deep embedded clustering
Zheng, J., Tang, Y., Peng, X., Zhao, J., Chen, R., Yan, R., Peng, Y., & Zhang, W. (2023) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2023.107852 · Cited by 6
Turković, E., Vasiljević, I., & Parojčić, J. (2024) · International Journal of Pharmaceutics · doi:10.1016/j.ijpharm.2024.124188 · Cited by 6
Ye, W., Yu, Y., & Cao, J. (2024) · International Journal of Climatology · doi:10.1002/joc.8473 · Cited by 6
“Due to the easy application and efficient calculation of the K-means clustering method, it has been used for various fields such as deep learning, marketing research, medicine, and biology (Ahmed et al., 2020).”
MethodEspinosa, A. B., & Rivera, D. (2024) · Education Policy Analysis Archives · doi:10.14507/epaa.32.8501 · Cited by 9
Zhang, X., Ding, C., Liang, G., Yang, P., & Wang, X. (2024) · IET Renewable Power Generation · doi:10.1049/rpg2.13054 · Cited by 6
Zhou, X., Zhao, J., Hu, S., & Yan, D. (2024) · Energy and Buildings · doi:10.1016/j.enbuild.2024.114686 · Cited by 6
Thaler, G., Nascimento, A. S. B. D. S., Pacheco, A. L. S., & Flesch, R. C. C. (2024) · Advanced Engineering Informatics · doi:10.1016/j.aei.2024.102841 · Cited by 6
Scuro, C., Alì, G., Fusaro, P. A., & Nisticó, S. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10826137 · Cited by 6
Regression, classification, and clustering algorithms
Palei, S., Lenka, R. K., Jain, P., & Saxena, S. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-13816-4.00002-4 · Cited by 6
de Icaya-Gómez, E. M., Izquierdo, E. M., Hernández-Viñas, M., & Naranjo-Hernandez, J. E. (2025) · Ecological Informatics · doi:10.1016/j.ecoinf.2025.103090 · Cited by 6
A novel self-supervised graph clustering method with reliable semi-supervision
Lu, W., Wang, M., Yu, Y., Ma, L., Shi, Y., Huang, Z., & Gong, M. (2025) · Neural Networks · doi:10.1016/j.neunet.2025.107418 · Cited by 7
Fernandez, C. D. O., Blikstein, P., & Lopes, R. D. D. (2025) · Journal of Science Education and Technology · doi:10.1007/s10956-025-10210-7 · Cited by 6
“The similarity between feature vectors was then determined using k-means, one of the most widely used unsupervised learning algorithms to separate a set of points into distinct groups (Ahmed et al., 2020; Rokach & Maimon, 2005).”
Zheng, Q., Li, C., Yang, B., Yan, Z., & Qin, Z. (2025) · Sensors · doi:10.3390/s25113314 · Cited by 6
“The k-means [23] algorithm is a distance-based clustering algorithm that is widely used in scientific and industrial fields due to its simple structure and fast convergence speed.”
Rios, B. H. O., & Xavier, E. C. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.128258 · Cited by 6
Bittencourt, J. C. N., Costa, D. G., Portugal, P., Peixoto, M. L. M., & Vasques, F. (2025) · International Journal of Disaster Risk Reduction · doi:10.1016/j.ijdrr.2025.105681 · Cited by 6
Wang, Y., Hu, H., & Du, W. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114246 · Cited by 8
Kim, Y., & Lee, S. (2022) · SAGE Open · doi:10.1177/21582440221093327 · Cited by 7
“The photos in the research sample were grouped into clusters by k -means algorithm (Ahmed et al., 2020).”
MethodA service-oriented energy assessment system based on BPMN and machine learning
Yan, W. P., Wang, X., Gong, Q., Zhang, X., Zhang, H., & Jiang, Z. (2022) · Autonomous Intelligent Systems · doi:10.1007/s43684-022-00036-0 · Cited by 6
A novel method for optimizing spectral rotation embedding K-means with coordinate descent
Chen, J., Zhu, J., Feng, B., Xie, S., Yang, H. X., & Nie, F. (2022) · Information Sciences · doi:10.1016/j.ins.2022.09.011 · Cited by 6
Robust on-line partial discharge measurement of 35-kV cables in wind farms via dual sensors
Yan, Y., Huo, P., & Li, H. (2022) · Energy Reports · doi:10.1016/j.egyr.2022.10.356 · Cited by 6
Reflectance Calibration with Normalization Correction in Hyperspectral Imaging
Cruz-Guerrero, I. A., León, R., Granados-Castro, L., Fabelo, H. A., Ortega, S., Campos-Delgado, D. U., & Callicó, G. M. (2022) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd57027.2022.00120 · Cited by 6
“This evaluation was carried out by using the standard K-means algorithm [18], with K equal to 4 and 9, and using the Euclidean and the L1 distances as metrics for each case, respectively.”
MethodRDE Calibration—Evaluating Fundamentals of Clustering Approaches to Support the Calibration Process
Krysmon, S., Claßen, J., Pischinger, S., Trendafilov, G., Düzgün, M. T., & Dorscheidt, F. (2023) · Vehicles · doi:10.3390/vehicles5020023 · Cited by 6
A comparative analysis on prototype-based clustering methods
Rada, R., Bedalli, E., Shurdhi, S., & Çiço, B. (2023) · Mediterranean Conference on Embedded Computing (MECO) · doi:10.1109/meco58584.2023.10154917 · Cited by 6
“Formally, this is expressed by an objective function that needs to be minimized [6]: 𝐽𝐽 ( 𝑋𝑋 , 𝑈𝑈 , 𝐶𝐶 ) = � � 𝑑𝑑 �𝑥𝑥 , 𝑐𝑐 � 𝑥𝑥 𝑗𝑗 ∈𝐶𝐶 𝑖𝑖 𝑖𝑖=1 Here X denotes the dataset, U denotes the partition matrix with binary values (0 and 1’s) and is an array containing the prototypes…”
Visual interpretation of deep deterministic policy gradient models for energy consumption prediction
Wang, H., Wang, Y., Lü, Y., Fu, Q., & Chen, J. (2023) · Journal of Building Engineering · doi:10.1016/j.jobe.2023.107847 · Cited by 6
Masoud, M. (2023) · IEEE Access · doi:10.1109/access.2023.3336810 · Cited by 6
Comparative Study of Clustering Algorithms: Scenario Based on Boston Crime Dataset
Jerin, J. Q., Khan, N. K., Biswas, S., & Sharmin, N. (2023) · International Conference on Computer and Information Technology (ICCIT) · doi:10.1109/iccit60459.2023.10441641 · Cited by 6
“Due to its effectiveness, density-based clustering remains one of the most widely used data mining algorithms [7]–[9].”
Priyadarshni, S. S., Fathima, R., Urolagin, S., Bongale, A. M., & Dharrao, D. S. (2023) · International Conference on Modeling, Simulation & Intelligent Computing (MoSICom) · doi:10.1109/mosicom59118.2023.10458783 · Cited by 6
“The paper [12] provides an overview of the limitations of the K-Means clustering algorithm, such as convergence issues and its inability to handle diverse data types.”
Santana, D. C., de Oliveira, I. C., Cavalheiro, S. B., das Chagas, P. H. M., Filho, M. C. M. T., Della-Silva, J. L., Teodoro, L. P. R., Campos, C. N. S., Baio, F. H. R., da Silva, C. A., et al. (2024) · AgriEngineering · doi:10.3390/agriengineering6020090 · Cited by 7
“The purpose of the k-means algorithm is to split the dataset based on the clustering criterion, in which data are grouped in view of trait similarity, and the designed groups by k-means are clusters [40].”
MethodEnhancing GPS Accuracy with Machine Learning: A Comparative Analysis of Algorithms
Zontul, M., ERSAN, Z. G., Yelmen, İ., Çevik, T., Anka, F., & Gesoglu, K. (2024) · Traitement du signal · doi:10.18280/ts.410332 · Cited by 6
“The K value in the algorithm sets the number of clusters, and this value is to be taken as a parameter [56]. where, J is the target function, k refers to the number of clusters, n denotes the number of cases, 𝑥 𝑖(𝑗) − 𝑐 𝑗 is the distance function, and c j is the centroid for cluster j [57].”
BackgroundChen, Y., Lin, X., Zhu, Y., Zhou, D., Zhang, Y., Huang, Y., Chen, H., Li, G., & Tian, C. (2024) · Aquaculture Reports · doi:10.1016/j.aqrep.2024.102247 · Cited by 9
Efendi, R., Junaidi, A., & Rizki, A. M. (2024) · Jurnal Informatika dan Teknik Elektro Terapan · doi:10.23960/jitet.v12i3.4997 · Cited by 6
“Data [22], GB-DPC [3], dan K-Means [23].”
Yang, B., Zhang, H., Zhao, Z., Chen, X., Chen, Y., & Yang, Y. (2024) · International Journal of Thermal Sciences · doi:10.1016/j.ijthermalsci.2024.109349 · Cited by 6
Optimizing the Evaluation of K-means Clustering Using the Weight Product
Dinata, R. K., Bustami, & Retno, S. (2024) · Revue d intelligence artificielle · doi:10.18280/ria.380416 · Cited by 6
“Ahmed et al. [10] discussed various K-means algorithm variants and their recent developments, assessing their effectiveness through experimental analyses on diverse datasets.”
Yu, Q., Huang, W., Liang, W., Liu, R., Han, X., Pan, Y., Wang, N., Yu, Y., Zhang, Z., Sun, L., et al. (2024) · Ultrasonics · doi:10.1016/j.ultras.2024.107446 · Cited by 6
NLP-based ergonomics MSD risk root cause analysis and risk controls recommendation
Parikh, P., Penfield, J., Barker, R., McGowan, B., & Mallon, J. R. (2024) · Ergonomics · doi:10.1080/00140139.2024.2394510 · Cited by 6
Liu, D., Huang, D., Chen, X., Dou, J., Tang, L., & Zhang, Z. (2024) · Electronics · doi:10.3390/electronics13173446 · Cited by 6
Pérez, M. T., Domínguez, J., Arribas, L., Amador, J., Ciller, P., & González-García, A. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.109249 · Cited by 6
Importance-Induced Customer Segmentation Using Explainable Machine Learning
Park, S., Jiang, Y., & Kim, H. (2024) · Journal of Mechanical Design · doi:10.1115/1.4066746 · Cited by 6
Phase-Angle-Encoded Snake Optimization Algorithm for K-Means Clustering
Xue, D., Pang, S.-Y., Liu, N., Liu, S., & Zheng, W. (2024) · Electronics · doi:10.3390/electronics13214215 · Cited by 7
Sun, C., Chen, J., Zhao, Y., Han, H., Jing, R., Tan, G., & Wu, D. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125903 · Cited by 8
Explainability of Network Intrusion Detection Using Transformers: A Packet-Level Approach
RajkumarDheivanayahi, P., Berry, R., Costagliola, N. U., Fiondella, L., Bastian, N. D., & Kul, G. (2024) · IEEE Access · doi:10.1109/access.2024.3525008 · Cited by 6
“We standardize the features to have a mean of zero and a variance of one to apply k-means clustering [39] to group the packets based on their similarities in the form of Euclidean distance.”
Xu, T., Cui, H., Song, Y., Zhang, C., Alghamdi, T., & Aborokbah, M. M. (2025) · Plants · doi:10.3390/plants14121794 · Cited by 6
Abboush, M., Knieke, C., & Rausch, A. (2025) · Results in Engineering · doi:10.1016/j.rineng.2025.105900 · Cited by 6
Du, Y., Deng, Y., Zhou, Y., Jiao, F., Wang, B., Xu, Z., Liu, Y., Jiang, Z., Song, J., & Guan, X. (2026) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2026.3652690 · Cited by 6
“(5) Each column corresponds to the phase modulation state [30] to construct sensing matrices for suppressing MPI.”
Schröder, S., & Kiko, R. (2022) · Sensors · doi:10.3390/s22072775 · Cited by 7
“It is used in many areas [45] and scales well with dataset size, can cluster even billions of samples and a wide range of implementations exist for different architectures [46,47].”
BackgroundSegmentación Efectiva de Clientes utilizando R: Técnicas para Administración y Marketing Avanzado
Peralta, M. A. C., Salazar, B. A. A., Bravo, M. G. E., Reyes, A. T. C., & Villegas, K. G. C. (2024) · doi:10.62131/978-9942-7173-2-0 · Cited by 6
Clustering Fake News with K-Means and Agglomerative Clustering Based on Word2Vec
Tianda, I. M., Ubadah, M. N., Mardianto, M. F. F., Munawwarah, S. A. A., Ishak, N. F., Amelia, D., & Ana, E. (2024) · INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH · doi:10.47191/ijmcr/v12i2.01 · Cited by 11
Cordeiro, D. F. (2024) · Documentación de las Ciencias de la Información · doi:10.5209/dcin.92187 · Cited by 6
Improving the Accuracy of Oncology Diagnosis: A Machine Learning-Based Approach to Cancer Prediction
Cabanillas-Carbonell, M., & Zapata-Paulini, J. E. (2024) · International Journal of Online and Biomedical Engineering (iJOE) · doi:10.3991/ijoe.v20i11.49139 · Cited by 6
Zhu, D., Gan, Y., & Chen, X. (2021) · Journal of Computational Methods in Engineering Applications · doi:10.62836/jcmea.v1i1.010102 · Cited by 25
“To create a dataset with varying distributions of customer data for implementing domain adaptation algorithms, we used the K-means algorithm [35–37] to partition the data into clusters.”
MethodMahmoud, M. S. A., Reda, E., Al-Mahdi, H., & Nassar, H. (2024) · Information Technology And Control · doi:10.5755/j01.itc.53.3.34530 · Cited by 6
“3 m Π RR mNI in step 14 is relabelling of each to R I K given as [43].”
BackgroundMethodInfluentialMarisa, ., Rudiansyah, M., Alexandro, R., Nathasia, N. D., Pudjoatmojo, B., & Maukar, A. L. (2022) · TEM Journal · doi:10.18421/tem113-25 · Cited by 6
CANTool An In-Vehicle Network Data Analyzer
Islam, M. R., Oh, I., & Yim, K. (2022) · International Conference on Information Technology Systems and Innovation · doi:10.1109/icitsi56531.2022.9970968 · Cited by 6
“K-means is calculated by measuring the distance between each data point and its centroid, squaring that distance, and summing those squares across the cluster [15].”
MethodObaid, A. Q., & Alabbas, M. (2024) · Iraqi Journal for Electrical And Electronic Engineering · doi:10.37917/ijeee.20.1.25 · Cited by 5
Lei, C., Shen, Y., Ji, Y., Cai, X., & Du, Y. (2025) · Journal of Advanced Transportation · doi:10.1155/atr/6825429 · Cited by 5
Strengthening incomplete multi-view clustering: An attention contrastive learning method
Hou, S., Guo, L., & Wei, X. (2025) · Image and Vision Computing · doi:10.1016/j.imavis.2025.105493 · Cited by 5
On the spatio-temporal coherence of extreme precipitation indices in subtropical Argentina
Ricetti, L., Hurtado, S. I., & Agosta, E. A. (2025) · Atmospheric Research · doi:10.1016/j.atmosres.2025.108082 · Cited by 5
Multivariate classification of livestock production systems in Mexico
Zaldivar-Gómez, A., Martínez-López, B., Suzán, G., & Rico‐Chávez, O. (2025) · Tropical Animal Health and Production · doi:10.1007/s11250-025-04389-5 · Cited by 6
“Dimension reduction techniques, such as Principal Components Analysis (PCA), Hierarchical Cluster Analysis (HCA), factorial analysis (FA), and Discriminant Analysis (DA), are widely used to investigate LPS (Vertel-Morinson et al. 2016; Makate et al. 2018; Shaner 2019) In Mexico, several research studies have employed…”
Rodríguez-Saiz, J., González-Rodrigo, B., Ayuga, J. G. R., Hidalgo-Leiva, D. A., & Marchamalo, M. (2025) · Applied Sciences · doi:10.3390/app15116318 · Cited by 5
Optimizing spatial clustering for supply chain networks
García, R. C., Galán, G., & Martín, M. (2025) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2025.109251 · Cited by 5
Tan, X., Li, Z., Suo, X., Li, W., Bi, L., & Yao, F. (2025) · The Visual Computer · doi:10.1007/s00371-025-04089-z · Cited by 5
“The K-Means algorithm [42, 43] was employed to further process the results obtained from the SOM.”
Mutual Calibration Network for Multi-View Clustering
Xiao, Y., Tang, C., Zheng, X., Yan, W., Liu, Y., & Liu, X. (2025) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2025.3588889 · Cited by 6
“Our mutual calibration network jointly optimizes the attribute features H v and structural features Z v , hence we apply K -means [65] clustering on Z f and H f to obtain the clustering results Y 1 and Y 2 .”
Improved WOA-DBSCAN Online Clustering Algorithm for Radar Signal Data Streams
Wan, H., Cheng, L., & Cui, Y. (2025) · Sensors · doi:10.3390/s25165184 · Cited by 5
“As a result, the k-means clustering algorithm [3–5] came into the limelight.”
Priore, E. D., Sbarra, R. G., Coppotelli, G., Lampani, L., & Pasquali, M. (2025) · Journal of Vibration Engineering & Technologies · doi:10.1007/s42417-025-02145-5 · Cited by 5
“K-means [37] and its K++ variant [ 38 ] is a common technique used to divide points in clusters.”
A survey on scenario-based test and evaluation methods for autonomous vehicles
Xie, D., Li, D., Zhao, Y., Liu, W., Zhao, Y., & Wang, N. (2025) · Proceedings of the Institution of Mechanical Engineers Part D Journal of Automobile Engineering · doi:10.1177/09544070251379541 · Cited by 5
Big Data Pipeline Optimisation for Electronic Health Records (EHR)
Tayal, C. (2024) · International Journal of Artificial Intelligence Data Science and Machine Learning · doi:10.63282/3050-9262.ijaidsml-v5i3p113 · Cited by 5
MCTuner: Spatial Decomposition-Enhanced Database Tuning via LLM-Guided Exploration
Yan, Z., Xi, R., & Hou, M. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3769807 · Cited by 6
Adaptive electric vehicle routing and charging with deep reinforcement learning
Ghahfarokhi, M. F., Park, H., Pandey, V., & Yoon, G. (2026) · Transportation Research Interdisciplinary Perspectives · doi:10.1016/j.trip.2025.101795 · Cited by 5
Global Gender Inequality Through Explainable AI: Machine Learning, Clustering, and SHAP Insights
Çelik, S., & Köroğlu, C. Z. (2026) · Social Science Computer Review · doi:10.1177/08944393261419809 · Cited by 5
Hazra, S., Ray, D. D., Hazra, A., Chatterjee, A., Mukhopadhyay, A., Ghorai, S., Ghosh, P. K., Bose, S., Roy, S., Nath, T., et al. (2026) · Plant Physiology Reports · doi:10.1007/s40502-026-00926-y · Cited by 5
Design of robust networks via reinforcement learning prompts the emergence of multi-backbones
Zhu, B., Zhu, T., Gao, J., Havlin, S., & Li, D. (2026) · Nature Communications · doi:10.1038/s41467-026-70745-0 · Cited by 7
Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures
Shkaberina, G. S., Verenev, L., Tovbis, E., Rezova, N. L., & Kazakovtsev, L. A. (2022) · Algorithms · doi:10.3390/a15060191 · Cited by 5
Evaluation of dimensionality reduction and unsupervised clustering methods in breast datasets
Liu, J., He, W., Wang, Y., & Zhang, B. (2024) · Applied and Computational Engineering · doi:10.54254/2755-2721/31/20230153 · Cited by 5
Double-Bounded Optimal Transport for Advanced Clustering and Classification
Shi, L., Shen, Z., & Yan, J. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i13.29419 · Cited by 5
Clustering Wilayah Kerawanan Stunting Menggunakan Metode Fuzzy Subtractive Clustering
Christyanti, R. D., Sulaiman, D., Utomo, A. P., & Ayyub, M. (2022) · Jurnal Ilmiah Teknologi Informasi Asia · doi:10.32815/jitika.v17i1.877 · Cited by 5
K-means Clustering of Intracellular Calcium Signal Transients
Lorencin, I., Frank, D., Tanković, N., & Horvat, T. (2024) · Acta Polytechnica Hungarica · doi:10.12700/aph.21.9.2024.9.6 · Cited by 5
“Iteratively, centroids are updated by computing the mean of the data points within each cluster, recalculating their positions [14].”
MethodJaballi, E., Gdaim, S., & Liouane, N. (2024) · International Conference on Control, Automation and Diagnosis (ICCAD) · doi:10.1109/iccad60883.2024.10553964 · Cited by 5
“This paper primarily deals with the K-means algorithm which is a clustering method that falls under the family of unsupervised learning [9], [10]. it plays an important role in a wide range of applications, including object recognition, image processing, statistics, and bioinformatics [11]–[14].”
MethodPredictive Analytics: An Optimization Perspective
Rodrigues, L., & Givigi, S. N. (2024) · IEEE Access · doi:10.1109/access.2024.3434617 · Cited by 5
“A comprehensive survey of k-means clustering including a thorough comparison of different versions of the k-means algorithm can be found in [20].”
BackgroundLivnat, D., Bilevich, M. M., & Halperin, D. (2024) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra57147.2024.10611716 · Cited by 6
“Hence after computing the gradients for each contact point, we cluster together similar gradients using K-means algorithm [49, 50].”
MethodHan, H., Yu, Q., Zhu, Y., Cheng, S., & Zhang, Y. (2024) · International Journal of Software Engineering and Knowledge Engineering · doi:10.1142/s0218194024500414 · Cited by 5
Dursun, M., & Alkurt, R. D. (2024) · Kybernetes · doi:10.1108/k-04-2024-0859 · Cited by 5
Driver Behavior at Roundabouts in Mixed Traffic: A Case Study Using Machine Learning
Hamad, F. A., Hasiba, R., Shahwan, D., & Ashqar, H. I. (2024) · Journal of Transportation Engineering Part A Systems · doi:10.1061/jtepbs.teeng-8325 · Cited by 5
GL-YOLOv5: An Improved Lightweight Non-Dimensional Attention Algorithm Based on YOLOv5
Liu, Y., Zhang, D., & Guo, C. (2024) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2024.057294 · Cited by 5
Firefly forest: A swarm iteration-free swarm intelligence clustering algorithm
Zeng, S., Wang, Y., Wen, Y., Yu, X., Li, B., & Wang, Z. (2024) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2024.102219 · Cited by 5
Yzzogh, H., & Benaboud, H. (2025) · Bulletin of Electrical Engineering and Informatics · doi:10.11591/eei.v14i2.8834 · Cited by 5
Flores, T. K. S., Medeiros, M. D. A., Silva, M., Costa, D. G., & da Silva, I. M. D. (2025) · IEEE Access · doi:10.1109/access.2025.3532849 · Cited by 5
“Each data point is then assigned to the nearest centroid based on a distance metric, typically the Euclidean distance [34].”
Machine Learning Algorithms for Predictive Maintenance: A Systematic Literature Mapping
Carrillo, J. P., & Barreno, C. R. (2025) · Revista Perspectivas · doi:10.47187/perspectivas.7.1.227 · Cited by 5
Moreau, J., Mechtouff, L., Rousseau, D., Eker, O., Berthezène, Y., Cho, T., & Frindel, C. (2025) · Frontiers in Neurology · doi:10.3389/fneur.2025.1434334 · Cited by 5
“This analysis uses two unsupervised clustering algorithms: the k-means algorithm (34) and the hierarchical clustering algorithm (35).”
KanDMVC: KAN be used for deep multi-view clustering?
Zhang, Y., Wang, Y., Lu, G., Gao, C., Cui, L., & Ma, Z. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.126868 · Cited by 5
Contrastive graph auto-encoder for graph embedding
Zu, S., Li, L., Shen, J., & Tang, W. (2025) · Neural Networks · doi:10.1016/j.neunet.2025.107367 · Cited by 5
Gallegos, Á., Gavito, M. E., Ferreira-Medina, H., Pat, E., Astier, M., Tinoco-Martínez, S. R., Merlín-Uribe, Y., & González-Esquivel, C. E. (2025) · Smart Agricultural Technology · doi:10.1016/j.atech.2025.100895 · Cited by 5
Smart contract generation model based on code annotation and AST-LSTM tuning
Yong, C., Defeng, H., Xu, C., Nannan, C., Shen, F., & Liu, J. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07186-x · Cited by 5
“K-means [48–50] as a distance partitioning related clustering algorithm.”
An Explainable Artificial Intelligence Framework for Breast Cancer Detection
Ridha, J., Saddami, K., Riswan, M., & Roslidar, R. (2025) · Indonesian Journal of Electronics Electromedical Engineering and Medical Informatics · doi:10.35882/ijeeemi.v7i2.78 · Cited by 5
“However, its performance heavily depends on the initial selection of centroids [18].”
Yang, X. Y., Lu, G., Zhang, J., Paneru, B., Dhungana, A., Dahal, S., Bist, R. B., & Chai, L. (2025) · Applied Sciences · doi:10.3390/app15126625 · Cited by 5
A Hybrid Numerical–Semantic Clustering Algorithm Based on Scalarized Optimization
Ifrim, A. M., & Oncioiu, I. (2025) · Algorithms · doi:10.3390/a18100607 · Cited by 5
#Nomask on Instagram: Exploring Visual Representations of the Antisocial Norm on Social Media
Kim, Y. (2022) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph19116857 · Cited by 5
“The photos in the research sample were clustered through k-means algorithm [49].”
MethodInvestigation of the benefits of passive TJI concept on cycle-to-cycle variability in a SI engine
Frasci, E., Novella, R., Plá, B., Arsie, I., & Jannelli, E. (2023) · International Journal of Engine Research · doi:10.1177/14680874221149115 · Cited by 5
“The interested reader can find a deep description of the algorithm in the paper of Lloyd,(41) or in the more recent review about k-means and applications.(42) K-means algorithm has three main steps: (i) initialization, (ii) assignment, and (iii) update.”
Background
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)

