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 701–800 of 1,001
Xia, L., Zheng, P., Keung, K. L., Xiao, C., Tao, J., & Liu, L. (2023) · Manufacturing Letters · doi:10.1016/j.mfglet.2023.08.045 · Cited by 4
Machine Learning Based Effective Clustering Scheme for Wireless Sensor Networks
Angadi, B. M., & Kakkasageri, M. S. (2023) · International Conference on Networks, Multimedia and Information Technology (NMITCON) · doi:10.1109/nmitcon58196.2023.10276315 · Cited by 4
“To group Sensor Nodes (SN) into cluster, the k-means employs the Euclidean distance as a similarity metric and has received a lot of attention with frequent usage[13] [14].”
MethodZhang, S., Xiao, F., Zhang, L., Zan, F., & Qiu, T. (2023) · IEEE Wireless Communications · doi:10.1109/mwc.005.2300073 · Cited by 4
“Then we use the K-Means Algorithm [12] to select some nodes from all nodes as base stations.”
MethodA Novel Filtering Method of Travel-Time Outliers Extracted from Large-Scale Traffic Checkpoint Data
Qi, W., Rao, B. M., & Fu, C. (2023) · Journal of Transportation Engineering Part A Systems · doi:10.1061/jtepbs.teeng-8082 · Cited by 4
A computational framework based on the dynamic pipeline approach
Pasarella, E., Vidal, M.-E., Zoltán, C., & Sales, J. P. R. (2024) · Journal of Logical and Algebraic Methods in Programming · doi:10.1016/j.jlamp.2024.100966 · Cited by 7
Spatial Monitoring of Geological Carbon Storage Progress Using Time-Lapse Satellite Images
Li, Y., Dodds, N., Leezenberg, P. B., & Kovscek, A. R. (2024) · SPE Western Regional Meeting · doi:10.2118/218879-ms · Cited by 4
Niyas, K. P. M., & Paramasivan, T. (2024) · Knowledge and Information Systems · doi:10.1007/s10115-024-02106-6 · Cited by 4
A Modified Version of K-Means Algorithm
Mexicano, A., Carmona, J. C., Cervantes, S., Cervantes, J.-A., López, S., & Rodríguez, R. (2021) · Lecture notes in networks and systems · doi:10.1007/978-3-030-89899-1_32 · Cited by 4
A Bayesian framework to model variance of grain yield response to plant density
Giordano, N., Hayes, D., Hefley, T. J., Lacasa, J., Beres, B. L., Haag, L. A., & Lollato, R. P. (2025) · Plant Methods · doi:10.1186/s13007-025-01355-y · Cited by 3
“First, k-means does not account for uncertainty associated with yield environment classifications [1, 19].”
Active Learning Based on Clustering Algorithms for the Detection of Grapes in Images
Wong, R. H., Kantikov, L., & Cecotti, H. (2023) · doi:10.1109/icsip57908.2023.10271067 · Cited by 3
Vowels' Articulatory Location Classification based on Formant Frequency
Abdulaziz, A., & Dawood, A. (2023) · International Conference on Decision Aid Sciences and Applications (DASA) · doi:10.1109/dasa59624.2023.10286585 · Cited by 3
“…version of LDA, the best classification will be carried out after projecting those data into a vector Wm, which maximize the following objective function [23]: where S B is the between classes scatter and S W is the sum of within each class scatters and they are calculated as follows: 𝑆 8 = (𝜇ω .”
Özdemir, A., & Sağlam, Y. C. (2024) · Journal of Business Research - Turk · doi:10.20491/isarder.2024.1772 · Cited by 3
Application of Data Mining in Disease Clustering at Klinik Keluarga
Kadafi, M. N., & Finandhita, A. (2024) · Komputa Jurnal Ilmiah Komputer dan Informatika · doi:10.34010/komputa.v13i1.11273 · Cited by 3
A One-Class-Based Supervision System to Detect Unexpected Events in Wastewater Treatment Plants
Arcano-Bea, P., Timiraos, M., Díaz-Longueira, A., Michelena, Á., Jove, E., & ROLLE, J. L. C. (2024) · Applied Sciences · doi:10.3390/app14125185 · Cited by 3
Gao, T., Qiu, C., Liu, S., & Zhuang, W. (2024) · International Conference on Electrical Engineering, Control and Robotics (EECR) · doi:10.1109/eecr60807.2024.10607304 · Cited by 3
“…the interaction performance (P)[19], in which the interaction performance (P) refers to the merging of the merging vehicle and the surrounding vehicles at the time of the merge potential risk between them, including time to collision (TTC), time headway (THW), and desired reaction time (DRT) [20].”
BackgroundPlakotaris, D. D., Kassandros, T., Bagkis, E., & Karatzas, K. D. (2024) · Atmosphere · doi:10.3390/atmos15080965 · Cited by 3
“The algorithm aims to minimize the sum of the squared distances between the data points and the assigned centroids of their clusters, leading to coherent and well-defined clusters [24].”
BackgroundThe Strategy of Human Resource Management Based on the K-Means Clustering Algorithm
Li, L., & Qiu, D. (2024) · International Journal of High Speed Electronics and Systems · doi:10.1142/s0129156424401153 · Cited by 3
Evaluating Methods for Violence Classification and Firearm Detection in Indoor CCTV Environment
da Silva, A. V. B., & Pereira, L. F. A. (2024) · Journal of the Brazilian Computer Society · doi:10.5753/jbcs.2024.3282 · Cited by 3
“Firstly, a subset of the descriptors must be grouped using a clustering algorithm such as KMeans [Ahmed et al ., 2020], which produces centroids known as visual words.”
MethodSinh-Cosh Optimization-Based Efficient Clustering for Big Data Applications
Khrissi, L., Es-Sabry, M., Akkad, N. E., Satori, H., Saad, A., & El‐Shafai, W. (2024) · IEEE Access · doi:10.1109/access.2024.3519156 · Cited by 3
“High-quality clustering reduces intra-cluster distances and increases inter-cluster distances [3].”
LE-GEMM: A lightweight emulation-based GEMM with precision refinement on GPU
Yu, Z., Lu, L., Yang, Z., Liang, Z., & Suo, S. (2025) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2025.103336 · Cited by 3
Mental Health and Moral Education in the Digital Age
Li, D. (2025) · International Journal of Web-Based Learning and Teaching Technologies · doi:10.4018/ijwltt.367868 · Cited by 9
“The goal of the k-means algorithm is to minimize the sum of squared distances between each data point and its cluster center, as expressed by the following objective function (Ahmed et al., 2020) shown in Equation 3.”
Self-weighted subspace clustering with adaptive neighbors
Liu, Z., Wang, H., Wang, L., & Zhao, Q. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.129754 · Cited by 4
Afsharipour, S., Li, J., & Menenti, M. (2025) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2025.3545404 · Cited by 3
“The segmentation algorithm employed in this study was the K -means clustering algorithm [74], where the value of K was set to 5.”
Mohapatra, P. P., Balakrishnan, R. K., & Priyadarsini, M. (2025) · Internet of Things · doi:10.1016/j.iot.2025.101614 · Cited by 3
Multi‐sequence brain tumor segmentation boosted by deep semantic features
Yin, Z., Ni, Z., Ren, Y., Nie, D., & Tang, Z. (2025) · Medical Physics · doi:10.1002/mp.17845 · Cited by 3
“23 In each iteration of the K -means, all feature vectors in G l are assigned to one of the K center vectors,to which the Euclidean distance is minimal.”
Araji, M. T., & Waqas, A. (2025) · Solar Energy · doi:10.1016/j.solener.2025.113623 · Cited by 3
Digital image representation by atomic functions: features for computer vision and machine learning
Makarichev, V. O., Лукин, В. В., Kryvenko, S., & Brysina, I. V. (2025) · Aerospace technic and technology · doi:10.32620/aktt.2025.3.08 · Cited by 3
Biogeochemical float deployment strategy in the Southwestern Indian ocean
Riom, W., Taillandier, V., Dimier, C., D’Ortenzio, F., & Claustre, H. (2025) · Deep Sea Research Part II Topical Studies in Oceanography · doi:10.1016/j.dsr2.2025.105504 · Cited by 3
Wang, X. (2025) · International Journal of Web-Based Learning and Teaching Technologies · doi:10.4018/ijwltt.383084 · Cited by 3
Dake, D. K., & Gyimah, E. (2025) · Informing Science The International Journal of an Emerging Transdiscipline · doi:10.28945/5596 · Cited by 3
Multi-view fusion neural networks for heterogeneous graph representation learning
Shi, Z., Wang, B., & Huang, J. (2025) · Applied Intelligence · doi:10.1007/s10489-025-06657-1 · Cited by 3
“We first put node features into the model, thus obtaining optimized node features, and then compare the performance of different methods on the node clustering task by putting the embedding features trained by the model into a k-means [1] cluster with a number of categories for each dataset.”
Flash Flood Risk Classification Using GIS-Based Fractional Order k-Means Clustering Method
Li, H., Huang, J., Zhang, X., Meng, Z., Fan, Y., Wu, X., Wang, L., Hu, L., & Zhang, J. (2025) · Fractal and Fractional · doi:10.3390/fractalfract9090586 · Cited by 3
Zhang, H., Huang, Y., Zhou, N., Du, J., & Li, X. (2025) · International Journal of Intelligent Computing and Cybernetics · doi:10.1108/ijicc-05-2025-0266 · Cited by 3
Fu, H., Sun, D., Wei, J., Wan, W., & Long, C. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3613971 · Cited by 3
“On this basis, clustering is performed using the K-means algorithm [55].”
Distillation anomaly and fault detection based on clustering algorithms
García, F. M. M., García, A. M., de León, F. C. G., & Alarcón, M. (2025) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2025.100970 · Cited by 3
de Sousa, E. L., Rodrigues, F. D. C. D. A., Saraiva, J. G. D. C., Santos, R. S. M., Zagury, D. G. M., & de Brito, G. E. (2025) · Epidemiologia e Serviços de Saúde · doi:10.1590/s2237-96222026v35e20240725.en · Cited by 3
Hai, L., Liu, G., Zhang, J., Li, X., Luo, C., Zhang, L., & Wu, F. (2026) · Renewable energy focus · doi:10.1016/j.ref.2026.100838 · Cited by 3
Autoregressive inverse design of disordered metamaterials for target nonlinear response
Zhao, D., Xiang, Y., Zhang, P., Liu, N., Wang, X., & Tang, K. (2026) · Thin-Walled Structures · doi:10.1016/j.tws.2026.114793 · Cited by 4
Andreani, R., Couto, K. R., Ferreira, O. P., Haeser, G., & Prudente, L. F. (2026) · SIAM Journal on Optimization · doi:10.1137/24m1692319 · Cited by 3
Li, D., Wu, K., Li, Y., Huang, J., & Liu, X. (2026) · Water · doi:10.3390/w18060740 · Cited by 3
Wang, Z., Xia, X., Huang, C., & Xie, L. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11463480 · Cited by 5
“Vector-quantized encoders and clustering of SSL features (VQ-VAE [12], k-means [15]) are widely used to produce discrete units that separate low-level acoustic information while retaining linguistic content [16].”
Li, L., Han, L., Miao, Q., Zhang, Y., & Jing, Y. (2022) · Land · doi:10.3390/land11112028 · Cited by 3
The digitization of the society of the European Union in 2018 and 2021
Becker, A., Becker, J., & Ziemba, P. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2022.09.415 · Cited by 3
Hybrid computational and real data-based positioning of small cells in 5G networks
Ferreira, F. H. C. S., Barros, F. J. B., Neto, M. C. D. A., Cardoso, E. H. S., Francês, C. R. L., & Araújo, J. (2023) · PeerJ Computer Science · doi:10.7717/peerj-cs.1412 · Cited by 3
Adaptation of European Enterprises to COVID-19 Pandemic: Cluster Analysis Findings
Bach, M. P., Jaković, B., & Jajić, I. (2023) · International Convention on Information and Communication Technology, Electronics and Microelectronics · doi:10.23919/mipro57284.2023.10159892 · Cited by 3
“The study uses K-means clustering [14], which has been widely used to study the homogeneity of countries according to various indicators of technological development ( [15]; [16]; [17]; [18]; [19]; [20]; [21]).”
MethodFuzzy clustering method with approximate orthogonal regularization
Yang, J., Qiu, A., & Yang, Z. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110829 · Cited by 3
Battery State-of-Health Evaluation for Roadside Energy Storage Systems in Electric Transportation
Deng, K., Shen, K., Dong, Z., Liang, Z., Zhao, L., Xu, T., & Yin, S. (2023) · Future Transportation · doi:10.3390/futuretransp3040072 · Cited by 3
“The K-Mean clustering algorithm uses the Euclidean norm to measure the similar degree between the alternatives [16] The range of features in the analysis and associated distance measures usually have an impact on the performance of the K-Means algorithm, since the distances between the data points…”
MethodData Segmentation with Improved K-Means Clustering Algorithm
Hasan, E., Rahman, M. A., Talukder, M. S., Utsho, M. F., Shakhan, M., & Farid, D. M. (2023) · International Conference on Computer and Information Technology (ICCIT) · doi:10.1109/iccit60459.2023.10441078 · Cited by 3
“The research of Ahmed et al. [7] highlighted two unavoidable problems with the k-Means algorithm (i.e., centroids selection, some clusters, and the ability to handle different types of data) and their possible solutions.”
BackgroundNurdiansyah, D., Ma’ady, M. N. P., Sukmawaty, Y., Utomo, M. C. C., & Mutiani, T. (2024) · BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN · doi:10.30598/barekengvol18iss2pp1095-1104 · Cited by 3
“The following are the research procedures to be carried out [14] .”
BackgroundQuality control in structured illumination-based super-resolution FRET imaging via machine learning
Di, X., Luo, Z., Nie, H., Wu, G., & Chen, T. (2024) · Optics Express · doi:10.1364/oe.530973 · Cited by 3
Zhang, X. (2024) · Entertainment Computing · doi:10.1016/j.entcom.2024.100879 · Cited by 3
Liu, Z., Dong, S., Chen, R., Zhou, Z., Ren, Z., Liu, H., Dong, Y., & Yang, T. (2024) · Journal of Lightwave Technology · doi:10.1109/jlt.2024.3453290 · Cited by 3
“Subsequently, the elbow function is applied to calculate the number of clusters for each model’s data, and the K-Means algorithm [23] is used for clustering to obtain variable intervals for each cluster.”
Li, F., Zhou, J., Wei, W., & Zhou, D. (2024) · Buildings · doi:10.3390/buildings14092970 · Cited by 3
Mapping the Wuling vehicle market with K-Means Clustering: An effective digital marketing strategy
Ardiansyah, G. T., Hasibuan, M. S., Santosa, S., & Heikal, J. (2024) · Jurnal Fokus Manajemen Bisnis · doi:10.12928/fokus.v14i2.10026 · Cited by 3
“After all data points are assigned to a specific cluster, the next step is to recalculate the centroid position of each cluster (Ahmed et al., 2020).”
MethodMârza, A.-C., Menviel, L., & Skinner, L. C. (2024) · Geochronology · doi:10.5194/gchron-6-503-2024 · Cited by 3
“K -medoids is more robust to noise and outliers in the data (Arora et al., 2016); furthermore, working with concrete data points as cluster centres, we can pinpoint their locations on the model grid.”
Zhang, Y., Wu, J., Lian, X., Li, Y., Cui, Y., & Xiang, M. (2024) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2024.109247 · Cited by 3
Personalized Video-Based Hand Taxonomy Using Egocentric Video in the Wild
Dousty, M., Fleet, D. J., & Zariffa, J. (2024) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2024.3495699 · Cited by 5
“For partitional clustering, the k-means algorithm was employed [34], with the k-means ++ initialization method [35], a maximum of 300 iterations, and a relative tolerance of 1e-4.”
Escobar, H., Cuevas, E., Luque, A., Barba-Toscano, O., & Pérez‐Cisneros, M. (2024) · Mathematics · doi:10.3390/math12233676 · Cited by 3
A profit-aware server deployment approach for edge computing
Wang, Z., Dong, H., Jin, X., & Chen, Y. (2024) · Computing · doi:10.1007/s00607-024-01357-z · Cited by 3
“In terms of time complexity, since our proposed algorithm is improved based on the K-Means algorithm, therefore, in Algorithms 1, the time complexity of our algorithm is the same as that of K-Means for O ( n ) [44].”
Protein Binding Site Representation in Latent Space
Lohmann, F., Allenspach, S., Atz, K., Schiebroek, C. C. G., Hiss, J. A., & Schneider, G. (2024) · Molecular Informatics · doi:10.1002/minf.202400205 · Cited by 3
Beyond water stress: Exploring the wastewater-irrigation for sustainable Agriculture
Csordás, A. (2024) · GeoScape · doi:10.2478/geosc-2024-0012 · Cited by 3
A multi-cycle recursive clustering algorithm for the analysis of social media data streams
Ayorinde, A. O., Panneerselvam, J., Yuan, B., & Liu, L. (2024) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-024-01826-4 · Cited by 3
UAV image analysis for detecting rice seedling gaps and gap effect on grain yield
Li, S., Yang, Y., Zhang, J., Wilson, L. T., Samonte, S. O. P., Dou, F., Bera, T., Zhou, X., Sanchez, D. L., & Wang, J. (2024) · Smart Agricultural Technology · doi:10.1016/j.atech.2024.100753 · Cited by 3
Taşgetiren, N., Şafak, I., & Aktaş, M. S. (2025) · Software Practice and Experience · doi:10.1002/spe.3407 · Cited by 3
“To do this, the proposed EF-ISF based methodology is examined through partition-based clustering algorithms such as K-Means [7], density-based clustering algo-rithmslikeDensity-BasedSpatialClusteringofApplications with Noise (DBSCAN) [8], and model-based clustering algorithms exemplified by the…”
Bhattacharya, P., & Verma, A. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-29654-3.00012-0 · Cited by 4
Comparison of Supervised and Unsupervised Machine Learning for Well-Log Depth Alignment
Acharya, S., Fabian, K., & Westeng, K. (2025) · SPE/IADC Drilling Conference · doi:10.2118/223730-ms · Cited by 5
Wang, K., Ouyang, Q., Liu, Y., Li, B., Wang, Y., Li, H., Dong, B., Fan, D., Zhao, J., Huang, S., et al. (2025) · Astrodynamics · doi:10.1007/s42064-024-0232-6 · Cited by 3
“To reduce the data volume for the sequence search and ensure ease of transfer between asteroids, we employed the k-means clustering algorithm [30] to process the asteroid data.”
An interpretable and reliable framework for alloy discovery in thermomechanical processing
Sinha, S., Ma, X., Rehman, K., Armanfard, N., & Yue, S. (2025) · Materials Today Communications · doi:10.1016/j.mtcomm.2025.112134 · Cited by 6
Saghir, R., Campos, I. B., Gouvêa, T. S., & Sonntag, D. (2025) · ACM International Conference on Intelligent User Interfaces (IUI) · doi:10.1145/3708557.3716359 · Cited by 3
“Clustering Methods: Users can choose from clustering techniques including K-Means [1] which partitions data into K distinct clusters based on distances to the centroid of the clusters, DBSCAN (Density-Based Spatial Clustering of Applications with Noise) [9] which identifies clusters as areas of…”
emGene: An Embodied LLM NGS Sequencer for Real-Time Precision Diagnostics
Luo, S., Yu, A., Xie, Z., Huang, H. B., Huang, M., Li, K., Pun, Y. K., Guo, Z., Li, S., Zhu, Y., et al. (2025) · Integrated Circuits and Systems · doi:10.23919/ics.2025.3552542 · Cited by 6
DASC: Learning discriminative latent space for video clustering
Lin, J., Gao, X., Zhang, Z., & Deng, H. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.130050 · Cited by 3
Multiscale Field Theory for Network Flows
Mikaberidze, G., Artime, O., Díaz-Guilera, A., & D’Souza, R. M. (2025) · Physical Review X · doi:10.1103/physrevx.15.021044 · Cited by 3
“Other alternatives include grouping by the k -core structure [45] or using machine-learning tools like k -means clustering directly on the profile data [46].”
Sun, X., Liu, X., Deng, C., Chu, H., Wang, G., & Zhao, H. (2025) · IEEE Access · doi:10.1109/access.2025.3596983 · Cited by 4
“K-means partitions data points into K clusters, where each sample is assigned to the cluster whose center is closest [16], [17], [18].”
Toufighi, S. P., Khani, A. M., Rezasoltani, A., Sahebi, I. G., & Vang, J. (2025) · Machine Learning with Applications · doi:10.1016/j.mlwa.2025.100770 · Cited by 3
Detecting Stealthy Data Poisoning Attacks in AI Code Generators
Improta, C. (2025) · IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) · doi:10.1109/issrew67781.2025.00080 · Cited by 4
“We explore two clustering methods: • K-Means [21] partitions the data into k clusters by assigning each point to the nearest cluster centroid.”
Ferilli, S., Pierro, D. D., Redavid, D., & Bernasconi, E. (2026) · International Journal of Data Science and Analytics · doi:10.1007/s41060-026-01087-9 · Cited by 3
Lay2Story: Extending Diffusion Transformers for Layout-Togglable Story Generation
Ma, A., Feng, J., Cao, K., Wang, J., Wang, Y., Zhang, Q., & Zhang, Z. (2025) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51701.2025.01494 · Cited by 15
“We then perform K-means clustering [1] to group similar frames.”
An Adaptive Clustering Algorithm Based on Circular Units
Wang, F., Xie, Y., Hu, Z., Zhang, K., & Zhang, Y. (2021) · International Conference on Artificial Intelligence and Big Data (ICAIBD) · doi:10.1109/icaibd51990.2021.9459037 · Cited by 3
Performance of K-means algorithm based an ensemble learning
Hashim, D. K., & Muhammed, L. A. (2022) · Bulletin of Electrical Engineering and Informatics · doi:10.11591/eei.v11i1.3550 · Cited by 3
“Includes issues with centroids that are randomly initialized, resulting unexpected convergence [1], [18].”
Shcherbakov, G. D., & Владимирович, Б. В. (2022) · ЗДОРОВЬЕ НАСЕЛЕНИЯ И СРЕДА ОБИТАНИЯ - ЗНиСО / PUBLIC HEALTH AND LIFE ENVIRONMENT · doi:10.35627/2219-5238/2022-30-4-44-53 · Cited by 3
Radhi, A. A., Akkar, H. A. R., & Abdullah, H. N. (2022) · Physical Communication · doi:10.1016/j.phycom.2022.101831 · Cited by 3
Typhoon complexity: Northwest Pacific tropical cyclone season complex systems analysis
Roca-Flores, E., Naumis, G. G., Solis, E. A. M., & Fraedrich, K. (2022) · International Journal of Modern Physics C · doi:10.1142/s0129183123500456 · Cited by 3
Territorial Development as an Innovation Driver: A Complex Network Approach
Nicolò, F. D., Monaco, A., Ambrosio, G., Bellantuono, L., Cilli, R., Pantaleo, E., Tangaro, S., Zandonai, F., Amoroso, N., & Bellotti, R. (2022) · Applied Sciences · doi:10.3390/app12189069 · Cited by 3
Sentiment Analysis for Super Applications in Indonesia: A Case Study of Gov2Go App
Pilliang, M., Akbar, H., & Firmansyah, G. (2022) · doi:10.1109/iconeei55709.2022.9972291 · Cited by 3
“The algorithm is K-Means because it is simple, fast, and the most popular [17], [18].”
MethodEnergy-efficient scheduling based clustering approach for wireless sensor networks of IoT
Jawad, L. W., & Idrees, A. K. (2022) · AIP conference proceedings · doi:10.1063/5.0112470 · Cited by 3
Improving Mass-Based Anomaly Detection Using Half-Space Trees and Data Drift for Streaming Data
Ghaddar, A., & Ghaddar, M. (2022) · International Conference on Imaging, Signal Processing and Communications (ICISPC) · doi:10.1109/icispc57208.2022.00019 · Cited by 3
“K-means clustering [9] is the most commonly used algorithm, however it takes long time in clustering when the number of data points is large.”
MethodHaque, M. A., Kumar, D., Mishra, K., Islam, F., & Mishra, B. (2022) · MOL2NET International Conference on Multidisciplinary Sciences (MOL2NET) · doi:10.3390/mol2net-08-12682 · Cited by 3
Sivakumar, S., & Kamalakannan, T. (2023) · EAI/Springer Innovations in Communication and Computing · doi:10.1007/978-3-031-23683-9_15 · Cited by 3
Sacile, R., Sallak, M., & Zero, E. (2023) · International Conference on System of Systems Engineering · doi:10.1109/sose59841.2023.10178509 · Cited by 3
“The distances used in the class computation can be different [14].”
BackgroundVlajnic, M. M., & Simske, S. (2023) · IEEE Access · doi:10.1109/access.2023.3307495 · Cited by 3
“COV methodology provides a measure of relative variability but does not give insights into the nature or causes of the variability, making the interpretation of results more difficult and in need of further context and domain knowledge [58].”
BackgroundQiao, Y. (2023) · Applied Mathematics and Nonlinear Sciences · doi:10.2478/amns.2023.2.00168 · Cited by 3
Sales Product Clustering Using RFM Calculation Model And K-Means Algorithm on Primskystore
Agussalim, A., Wardhani, R. K. P., & Anjani, A. (2023) · Technium Romanian Journal of Applied Sciences and Technology · doi:10.47577/technium.v16i.9978 · Cited by 3
“One of the often employed clustering algorithms in data analysis is K-Means, which partitions the dataset into many groups by utilizing the Euclidean distance metric [4].”
MethodIntelligent Analysis of Vehicle Accidents to Detect Road Safety: A Systematic Literature Review
Sun, W., Abdullah, L. N., Khalid, F. B., & Sulaiman, P. S. (2023) · International Journal of Academic Research in Business and Social Sciences · doi:10.6007/ijarbss/v13-i11/19260 · Cited by 3
“To address these issues, Ahmed et al. provide a well organized and comprehensive summary of the research done on the k-means method (Ahmed et al., 2020).”
BackgroundDemand Response Programs for Peak Reduction Using Consumers Aggregation
Zheiry, M., Faria, P., & Vale, Z. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.784 · Cited by 3
Chayangkoon, N., & Kasemtaweechok, C. (2023) · International Computer Science and Engineering Conference · doi:10.1109/icsec59635.2023.10329750 · Cited by 3
“3) Assign these k data points as the initial centroids [11]. b) The farthest first: The farthest first algorithm begins by randomly selecting an initial centre point for the cluster.”
BackgroundTemporal Analysis of World Disaster Risk: A Machine Learning Approach to Cluster Dynamics
Christian, M. M., & Choi, H. (2023) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc58733.2023.10393687 · Cited by 3
“It is especially valuable when dealing with unlabeled data necessitating the identification of patterns or groupings within the dataset[9] and was employed to cluster countries according to shared characteristics across time predicated on their inherent resemblances.”
BackgroundUsing Density and Fuzzy Clustering for Data Cleaning and Segmental Description of Livestock Data
Skjerve, T. A., Klemetsdal, G., Åby, B. A., Sommerseth, J. K., Indahl, U. G., & Olsen, H. F. (2024) · Journal of Agricultural Biological and Environmental Statistics · doi:10.1007/s13253-024-00622-0 · Cited by 3
“It is however, sensitive to noise in the data, which can result in sub-optimal clustering results (Ahmed et al. 2020).”
Hua, Y. T. H., Nguyen, G. H., Binh, L. B., & Liet, D. V. (2024) · International Journal of Computing and Digital Systems · doi:10.12785/ijcds/160177 · Cited by 3
Analysis and visualization of BPJS on twitter using K-means clustering
Saputra, A. B., Cahyo, P. W., Habibi, M., & Priadana, A. (2022) · International Journal of Health Science and Technology · doi:10.31101/ijhst.v3i3.2466 · Cited by 3
Naldi, M., Freda, A., Nicosia, G., Pacifici, A., Teti, G., & Feccia, M. A. (2024) · IEEE Mediterranean Electrotechnical Conference (MELECON) · doi:10.1109/melecon56669.2024.10608565 · Cited by 3
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)

