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 401–500 of 1,001
Leone, F., Caporali, A., Pascarella, A., Perciballi, C., Maddaluno, O., Basti, A., Belardinelli, P., Marzetti, L., Lorenzo, G. D., & Betti, V. (2024) · NeuroImage · doi:10.1016/j.neuroimage.2024.120896 · Cited by 8
“We chose it over the k-means algorithm (Ahmed et al., 2020) for its ability to identify clusters of non-circular shape and because it does not need the number of clusters as an input parameter.”
Arpaïa, P., Cacciapuoti, M., Cataldo, A., Criscuolo, S., Benedetto, E. D., Masciullo, A., Pesola, M., & Schiavoni, R. (2024) · Sensors · doi:10.3390/s24237794 · Cited by 8
Azimi, H., Kalhor, E. G., Nabavi, S. R., Behbahani, M., & Vardini, M. T. (2025) · Journal of the Taiwan Institute of Chemical Engineers · doi:10.1016/j.jtice.2025.105996 · Cited by 8
Granato, G., Costanzo, R., Borghi, A. M., Mattera, A., Carruthers, S. P., Rossell, S. L., & Baldassarre, G. (2025) · Scientific Reports · doi:10.1038/s41598-025-89555-3 · Cited by 9
“Specifically, we administrated the Wisconsin Cards Sorting Test (WCST; the gold-standard neuropsychological test of executive functions; 26 ) to 162 SSD patients and 108 healthy controls, and we computed the clinical behavioural data with a data-driven clustering algorithm (K-means; 27 ).”
Development of AI in the Caribbean: algorithms, challenges and recommendations
Mohammed, A. M. S., & Ahmad, S. (2025) · Insights into Regional Development · doi:10.70132/w9385223236 · Cited by 9
Auxiliary Reward Generation With Transition Distance Representation Learning
Li, S., Han, S., Zhao, Y., Yang, Y., Zhao, Q., & Liu, P. (2025) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2025.3554861 · Cited by 8
“These states are encoded by the TDRP encoder φ and grouped into n clusters with the k-means method [37].”
An improved YOLOv5s-based method for detecting rice leaves in the field
Zhou, C., Zhou, C., Yao, L., Du, Y., Fang, X., Chen, Z., & Yin, C. (2025) · Frontiers in Plant Science · doi:10.3389/fpls.2025.1561018 · Cited by 8
PV Production Forecast Using Hybrid Models of Time Series with Machine Learning Methods
Haupt, T., Trull-Domínguez, Ó., & Moog, M. (2025) · Energies · doi:10.3390/en18112692 · Cited by 8
Kang, S., & Shang, Y. (2025) · Journal of Environmental Management · doi:10.1016/j.jenvman.2025.126112 · Cited by 8
Auralization of Concert Halls for Touristic Purposes
Schauer, S., Bertocci, S., Cioli, F., Sieck, J., Shakhovska, N., & Вовк, О. (2022) · i-com · doi:10.1515/icom-2022-0008 · Cited by 8
K-means find density peaks in molecular conformation clustering
Wang, G., Fu, T., Ren, H., Xu, P., Guo, Q., Mou, X., Li, Y., & Li, G. (2022) · Chinese Journal of Chemical Physics · doi:10.1063/1674-0068/cjcp2111261 · Cited by 8
Li, X., & Luchun, Y. (2022) · Ocean Engineering · doi:10.1016/j.oceaneng.2022.112936 · Cited by 8
Exploring the Application of Machine Learning Algorithms to Water Quality Analysis
Abraham, A., Livingston, D., Guerra, I., & Yang, J. Y. (2022) · IEEE/ACIS International Conference on Big Data, Cloud Computing, and Data Science (BCD) · doi:10.1109/bcd54882.2022.9900636 · Cited by 8
“K-means also has issues with categorical data as it is difficult to calculate distance [14].”
BackgroundUnsupervised Learning Algorithms for Denial of Service Detection in Vehicular Networks
El Attar, A., Fadlallah, A., Chbib, F., & Khatoun, R. (2022) · 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME) · doi:10.1109/iceccme55909.2022.9987992 · Cited by 8
“K-Means is a widely used ”clustering” algorithm [24].”
MethodNumerical investigation of the blocking effect of a short duct on propeller noise
Jiang, H., Zhou, T., Guo, J., & Chen, W. (2023) · The Journal of the Acoustical Society of America · doi:10.1121/10.0017975 · Cited by 8
Occupational Road Safety Management: A Preliminary Insight for a Landfill Remediation Site
Lombardi, M., Mauro, F., Berardi, D., & Galuppi, M. (2023) · Buildings · doi:10.3390/buildings13051238 · Cited by 8
Information technology for intellectual analysis of item descriptions in e-commerce
Cherednichenko, O., Ivashchenko, O., Lincényi, M., & Kováč, M. (2023) · Journal of Entrepreneurship and Sustainability Issues · doi:10.9770/jesi.2023.11.1(10 · Cited by 8
K-Means Clustering Algorithm for Partitioning the Openness Levels of Open Government Data Portals
Emigawaty, E., Adi, K., Rochim, A. F., Warsito, B., & Wibowo, A. (2023) · JOIV International Journal on Informatics Visualization · doi:10.30630/joiv.7.3.1761 · Cited by 8
“The scatter plot presents data points on two axes, showing the relationship between two variables [23], [26], [27].”
BackgroundFederated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users
Yang, H., Liu, X., Wang, Z., Xie, H. L., Lui, J. C. S., Lian, D., & Chen, E. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i18.30045 · Cited by 8
Deep-Learning-Based Action and Trajectory Analysis for Museum Security Videos
Maio, C. D., Nunziati, G., & Mecocci, A. (2024) · Electronics · doi:10.3390/electronics13071194 · Cited by 9
Windowed hypergraph Fourier transform and vertex-frequency representation
Col, A. D., Petronetto, F., Neto, J. R. D. O., & Lima, J. B. (2024) · Signal Processing · doi:10.1016/j.sigpro.2024.109538 · Cited by 8
Moloko, L. E., Bokov, P. M., Wu, X., & Ivanov, K. (2024) · Annals of Nuclear Energy · doi:10.1016/j.anucene.2024.110630 · Cited by 8
“The 𝑘 -means and AP clustering algorithms have been widely used in various research fields, often in combination with or as a component of other algorithms, and their effectiveness, drawbacks, and solutions have been reported [9, 10, 11, 12, 13].”
Yaro, A. S., Malý, F., Malý, K., & Pražák, P. (2024) · IEEE Access · doi:10.1109/access.2024.3446674 · Cited by 8
“Several clustering algorithms, such as k-means [8], fuzzy c-means (FCM) [9], and affinity propagation clustering (APC) [10], have been used to carry out fingerprint database clustering, and each has its advantages and disadvantages over the other.”
MethodKong, Y., Qian, Y., Tan, F., Bai, L., Shao, J., Ma, T., & Tereshchenko, S. N. (2022) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-213564 · Cited by 8
“T k-means clustering algorithm, as one of the commonly used data mining methods, has attracted much attention for its simple and efficient implementation, andhasbeenwidelyusedandstudied[10–13].”
RetractedAutomated Crop Residue Estimation via Unsupervised Techniques Using High-Resolution UAS RGB Imagery
Azimi, F., & Jung, J. (2024) · Remote Sensing · doi:10.3390/rs16071135 · Cited by 7
Tensor-Based Late Fusion Incomplete Multiview Clustering
Guo, X., Yang, M., & Lu, G.-F. (2025) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2025.3565971 · Cited by 7
“(1) is equivalent to the following matrix form [27]: √ where K is the kernel matrix with K i,j = Φ( i ) T Φ( j ) .”
Ramya, S., Srinath, S., & Tuppad, P. (2025) · Procedia Computer Science · doi:10.1016/j.procs.2025.03.263 · Cited by 7
Xing, Y., Wang, J., Cui, S., Liu, X., & Song, M. (2025) · Progress in Nuclear Energy · doi:10.1016/j.pnucene.2025.105982 · Cited by 10
Pant, Y. R., Leigh, L. M., & Rueda, J. F. (2025) · Algorithms · doi:10.3390/a18080532 · Cited by 7
A cluster-assisted differential evolution-based hybrid oversampling method for imbalanced datasets
Karabıyık, M. A., Türkoğlu, B., & Aşuroğlu, T. (2025) · PeerJ Computer Science · doi:10.7717/peerj-cs.3177 · Cited by 7
Dual-splitting conformal prediction for multi-step time series forecasting
Yu, Q., Cao, Z., Wang, R., Yang, Z., Deng, L., Hu, M., Luo, Y., & Zhou, X. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.113825 · Cited by 7
“In this work, we adopt k-means approach [44] to ensure that 𝐾 𝑡 with similar trends and magnitudes are grouped together.”
Yu, K., Chen, F., Yu, M., Liang, J., & Chen, K. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3612490 · Cited by 7
“Common clustering algorithms such as K -means [52] and hierarchical clustering [53] can divide the solutions into multiple clusters based on their distribution, with each cluster representing a potential modality.”
Robust out-of-distribution prediction of Buchwald–Hartwig reactions
Neves, P., Hao, B., Aikonen, S., Diccianni, J. B., Wegner, J. K., Schwaller, P., & Strambeanu, I. I. (2026) · Nature Computational Science · doi:10.1038/s43588-026-01017-6 · Cited by 7
“We address data bias 33 by testing on OOD data; OOD was created by clustering all available reactions with DRFP and k -means 34 and only testing in the clusters where source is not represented.”
Zhang, H., Chen, W., Liu, Q., Miao, Q., & Huang, J. (2026) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2026.3654729 · Cited by 7
“…algorithm that partitions the data into K clusters by minimizing the distance between each sample and the centroid of its assigned cluster [24], as shown in the following objective function: where C j represents the j th sample cluster, and µ j represents the centroid of the j th cluster.”
Huang, P., Zheng, X., Zhang, Y., & Shen, P. (2026) · Energy and Buildings · doi:10.1016/j.enbuild.2026.117213 · Cited by 7
Fast and precise collision detection for detailed and complex physiological structures
Shi, C., Yang, Q., Zhao, X., Shi, S., Yibulayimu, S., Liu, J., Wang, Y., & Zhao, C. (2023) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2023.107707 · Cited by 7
Rangel-Olvera, B., & Rosas-Romero, R. (2023) · Multimedia Tools and Applications · doi:10.1007/s11042-023-17550-9 · Cited by 7
“Image segmentation is accomplished with k-means clustering [26, 27].”
Wu, J., Li, J., Wang, X., Xu, L., Li, Y., Li, J., Zhang, Y., & Xie, T. (2024) · Water · doi:10.3390/w16091290 · Cited by 7
CBCG: A Clustering Algorithm Based on Bidirectional Conical Information Granularity
Yu, B., Zheng, Z., Cai, M., Witold Pedrycz, C., & Xu, Z. (2024) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2024.3397808 · Cited by 7
“Typical clustering algorithms include center-based clustering represented by k -means [5] and fuzzy C-means (FCM) [6], [7], [8], hierarchical clustering represented by agglomerative hierarchical clustering [9], [10], [11] and balanced iterative reducing and clustering using hierarchies (BIRCH)…”
MethodEstella, T., Ghayatrie, N. A. I., & Wibowo, A. (2024) · International Journal of Computing and Digital Systems · doi:10.12785/ijcds/160175 · Cited by 7
Gu, Y., Liu, H., Chen, F., Xue, X., & Li, H. (2024) · Measurement Science and Technology · doi:10.1088/1361-6501/ad5749 · Cited by 7
“(2) A typical single clustering model is used to distribute the data, and the single clustering algorithms used are K-means clustering [31], Hierarchical Clustering (HC) [32], Gaussian Mixture Model Clustering (GMMC) [33], and Spectral Clustering (SC) [34].”
Chang, S.-C., & Jeng, J.-T. (2024) · International Journal of Fuzzy Systems · doi:10.1007/s40815-024-01809-w · Cited by 7
“Unlike hard clustering methods (like K-means) [20], where each data point belongs to exactly one cluster, FCM allows data points to belong to multiple clusters with varying degrees of membership.”
Uthayansuthi, N., & Vateekul, P. (2024) · IEEE Access · doi:10.1109/access.2024.3442445 · Cited by 9
“K-means is an unsupervised machine learning algorithm [30].”
MethodKim, H., Caesary, D., Jang, J.-W., & Mah, D. N. (2024) · Heliyon · doi:10.1016/j.heliyon.2024.e36951 · Cited by 7
“It has been used in statistics, pattern recognition, and image processing [63,64].”
MethodChoi, K. J., Kim, S., Kwon, Y., & Sim, M. K. (2024) · Korean Journal of Chemical Engineering · doi:10.1007/s11814-024-00286-z · Cited by 7
“K-means clustering is a method used for partitioning a dataset into k clusters, where each data point belongs to the cluster with the nearest centroid [34].”
An interactive clustering method via metric learning for analyzing energy consumption patterns
Wang, Y., Cao, T., Wang, H., Fu, Q., Chen, J., & Lu, Y. (2024) · Journal of Building Engineering · doi:10.1016/j.jobe.2024.111143 · Cited by 7
WISE: Efficient WSI selection for active learning in histopathology
Kang, H., Kim, M., Ko, Y. S., Cho, Y., & Yi, M. Y. (2024) · Computerized Medical Imaging and Graphics · doi:10.1016/j.compmedimag.2024.102455 · Cited by 8
Yin, G., Feng, Y., Jiang, Y., & Bao, Y. (2024) · Applied Sciences · doi:10.3390/app142210191 · Cited by 7
Giugliano, G., Pirone, D., Běhal, J., Wang, Z., Cerbone, V., Mugnano, M., Licitra, F., Montella, A., Scalia, G., Capasso, M., et al. (2024) · Journal of the Optical Society of America A · doi:10.1364/josaa.536841 · Cited by 7
Gwak, G., Hwang, U., & Kim, J. (2024) · Journal of Bodywork and Movement Therapies · doi:10.1016/j.jbmt.2024.11.034 · Cited by 7
Semantic segmentation via fusing 2D image and 3D point cloud data with shared multi-layer perceptron
Zhao, X., Wang, J., Wu, Z., & Chen, Y. (2024) · International Journal of Remote Sensing · doi:10.1080/01431161.2024.2439082 · Cited by 7
“Subsequently, the sampled points are grouped using the K-nearest neighbours algorithm (K-Means) (Ahmed, Seraj, and Islam 2020).”
Physically interpretable performance metrics for clustering
Mondal, K., & Klauda, J. B. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0241122 · Cited by 7
Synthesising climate and traffic factors for pavement regionalisation in China
Cao, R., Yao, L., & Leng, Z. (2025) · International Journal of Pavement Engineering · doi:10.1080/10298436.2025.2450098 · Cited by 7
“The algorithm’s performance depends on the chosen k value, with different values leading to varied results (Ahmed et al .”
Safe deep reinforcement learning for flow control within the Internet of Vehicles
Knari, A., Koulali, M.-A., & Khoumsi, A. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.126437 · Cited by 7
Luo, T., Peng, H., Fu, A., Yang, W. Y., Pang, L., Al-Sarawi, S. F., Abbott, D., & Gao, Y. (2025) · Computer Communications · doi:10.1016/j.comcom.2025.108052 · Cited by 7
Ditta, A., Zhang, R., Nawaz, H., Majeed, M. I., He, S., Zhuang, Z., Rütten, S., Shahzadi, A., Yaseen, S., Kiessling, F. M., et al. (2025) · Spectrochimica Acta Part A Molecular and Biomolecular Spectroscopy · doi:10.1016/j.saa.2025.125864 · Cited by 7
A Novel Hybrid OCC/RF Architecture for IoT-Based Smart Farming
Luna‐Rivera, J. M., Hernandez-Morales, C. A., Matus, V., Rabadan, J. A., Rufo, J., Guerra, V., & Pérez‐Jiménez, R. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3543443 · Cited by 7
“Our data recovery process employs the K-means algo-rithm [37] to differentiate between the various symbols or luminosity levels generated by the 4-PAM modulation, as discussed in Section IV-A.”
Assessment of spatial monitoring of geological carbon storage using InSAR
Li, Y., Leezenberg, P. B., & Kovscek, A. R. (2025) · Gas Science and Engineering · doi:10.1016/j.jgsce.2025.205591 · Cited by 7
Use of machine learning algorithms in the context of sugarcane in Brazil: a review
Cardoso, L. A. S., de Mesquita, B. D. R., & Farias, P. R. S. (2025) · Iran Journal of Computer Science · doi:10.1007/s42044-025-00250-y · Cited by 8
“Common machine learning methods in this category include Bayesian networks [66], k-means clustering [89], and Latent Dirichlet Allocation (LDA) [90].”
Two-step cluster analysis for energy performance indicators comparison
Rađenović, Ž. J., & Rajić, M. N. (2025) · Thermal Science · doi:10.2298/tsci250205056r · Cited by 7
A UAV-enabled mobile edge computing paradigm for dependent tasks based on a computing power pool
Lai, X., Guo, Y., He, M., Yuan, H., Li, W., & Cui, X. (2025) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2400465 · Cited by 7
“Then, when updating the center of mass, the weight is considered, so that the farther away from the starting point, the fewer user data are clus‐ tered (Ahmed et al., 2020).”
Prediction of rare and anomalous minerals using anomaly detection and machine learning techniques
Sharapatov, A., Садуов, А., Assirbek, N., Abdyrov, M., & Zhumabayev, B. T. (2025) · Applied Computing and Geosciences · doi:10.1016/j.acags.2025.100250 · Cited by 9
Gu, Y., Li, Z., Wei, H., Zhang, G., & Xu, Y. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3567763 · Cited by 7
“Typically, clustering research employs k -means algorithm [70].”
Prashanthan, A. (2025) · Journal of Computing Theories and Applications · doi:10.62411/jcta.13194 · Cited by 7
“The optimal number of clusters (k) that maximizes the distance calculable from the dataset [14], [93].”
InfluentialFace Shape-Based Physiognomy in LinkedIn Profiles with Cascade Classifier and K-Means Clustering
Purwono, P., Ma’arif, A., & Wulandari, A. T. (2021) · Proceeding of the Electrical Engineering Computer Science and Informatics · doi:10.23919/eecsi53397.2021.9624262 · Cited by 7
“To provide a clear boundary between the hairline and forehead skin, we use the K-Means Clustering algorithm, a classic distance-based algorithm [40][41].”
MethodHigh-density pedestrian detection algorithm based on deep information fusion
Zhang, H., Yang, X., Hu, Z., Hao, R., Gao, Z., & Wang, J. (2022) · Applied Intelligence · doi:10.1007/s10489-022-03354-1 · Cited by 7
“The representative algorithms are K-means [13, 14] and K-means++ [15, 16].”
MethodDensity-based clustering algorithm for associating transformers with smart meters via GPS-AMI data
Cook, E., Saleem, B., Weng, Y., Abate, S., Kelly-Pitou, K. M., & Grainger, B. M. (2022) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2022.108291 · Cited by 8
Zaręba, M., Danek, T., & Stefaniuk, M. (2023) · Energies · doi:10.3390/en16010493 · Cited by 7
Assessing Digital Competence Through Teacher Training in Early Education Teachers
Guallichico, G., Ocaña, M., Tejada, C., & Bautista, C. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-24978-5_6 · Cited by 9
Flathmann, C., Meyer, T., Titova, V., Schmidt, J., & Seibt, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-29831-2 · Cited by 7
Al-Maatoq, M., Fachet, M., Rao, R. N., & Hoeschen, C. (2023) · Magnetochemistry · doi:10.3390/magnetochemistry9030079 · Cited by 7
Eyes on the Road: A Survey on Cyber Attacks and Defense Solutions for Vehicular Ad-Hoc Networks
Hankins, A., Das, T., Sengupta, S., & Feil-Seifer, D. (2023) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc57344.2023.10099187 · Cited by 7
“The K-means clustering algorithm is particularly useful in this scenario, as it handles large data sets well despite its limitations in handling data of varying types [31].”
MethodFully Automated Density-Based Clustering Method
Bataineh, B., & Alzahrani, A. A. (2023) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2023.039923 · Cited by 9
An Intelligent Technique for Initial Distribution of Genetic Algorithms
Charilogis, V., Tsoulos, I. G., & Stavrou, V. N. (2023) · Axioms · doi:10.3390/axioms12100980 · Cited by 7
Mochurad, L., Sydor, A., & Ratinskiy, O. (2023) · Frontiers in Big Data · doi:10.3389/fdata.2023.1292923 · Cited by 7
Offshore Wind Energy Assessment with a Clustering Approach to Mixture Model Parameter Estimation
Huang, W., Zhu, X., Xia, H., & Wu, K. (2023) · Journal of Marine Science and Engineering · doi:10.3390/jmse11112060 · Cited by 7
Surface defect detection of steel based on improved YOLOv5 algorithm
Jiang, Y. (2023) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2023879 · Cited by 7
“While the original YOLOv5 uses the K-means method [25] for clustering anchor box positions, K-means has inherent limitations.”
MethodPacella, M., Mangini, M., & Papadia, G. (2023) · Algorithms · doi:10.3390/a16110524 · Cited by 7
Sun, S., Payne, E., Layton, A., Davis, K., Hossain‐McKenzie, S., & Jacobs, N. (2023) · North American Power Symposium (NAPS) · doi:10.1109/naps58826.2023.10318688 · Cited by 7
“K-means algorithm clusters the data points by the nearest centroids [31].”
MethodXin, R., Lin, J., Shi, S., Zhang, R., Zhang, J., & Zhu, J. (2024) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2024.111190 · Cited by 7
Measuring and identifying pre-service fatigue due to hypoxic exposure
Wang, Y., Gu, B., Miao, C., Yu, Y., Huang, Y., Zhang, Z., & Fang, D. (2024) · Automation in Construction · doi:10.1016/j.autcon.2024.105307 · Cited by 7
Unsupervised text feature selection by binary fire hawk optimizer for text clustering
Msallam, M. M., & Idris, S. A. (2024) · Cluster Computing · doi:10.1007/s10586-024-04364-z · Cited by 7
Classification of soybean groups for grain yield and industrial traits using Vnir-Swir spectroscopy
Santana, D. C., Seron, A. C. D. S. C., Teodoro, L. P. R., de Oliveira, I. C., da Silva, C. A., Baio, F. H. R., Ítavo, C. C. B. F., Ítavo, C. C. B. F., & Teodoro, P. E. (2024) · Infrared Physics & Technology · doi:10.1016/j.infrared.2024.105326 · Cited by 7
Predicting Global Education Quality: A Comprehensive Machine Learning Approach Using World Bank Data
Hatimi, R. E., Choukhan, C. F., Moussaid, A., & Esghir, M. (2024) · International Journal of Engineering Pedagogy (iJEP) · doi:10.3991/ijep.v14i4.48205 · Cited by 7
Wulandari, V., Syarif, Y., Alfian, Z., Althof, M. A., & Mufidah, M. (2024) · Indonesian Journal of Applied Technology and Innovation Science · doi:10.57152/ijatis.v1i1.1135 · Cited by 10
“Similar characteristics group into one homogeneous cluster, while data with distinct characteristics form separate clusters [6].”
BackgroundA Regionalization Approach Based on the Comparison of Different Clustering Techniques
Colmenero, J. L. A., & García-Miguel, J. P. (2024) · Applied Sciences · doi:10.3390/app142210563 · Cited by 7
Qin, C., Fang, C., Yao, K., Chen, X., Zhuang, F., & Zhu, H. (2025) · ACM Transactions on Management Information Systems · doi:10.1145/3712306 · Cited by 16
“Subsequently, we employ the k-means algorithm [2] to cluster R OOD t + 1 into k k-means distinct groups.”
Acceptance of Tourist Offers and Territory: Cluster Analysis of Ibiza Residents (Spain)
Cardona, J. R., Miranda, D. D. P., & Sánchez-Fernández, M. D. (2021) · Land · doi:10.3390/land10070734 · Cited by 7
K-means algorithm for clustering system of plant seeds specialization areas in east Aceh
Dinata, R. K., Hasdyna, N., Retno, S., & Nurfahmi, M. (2021) · ILKOM Jurnal Ilmiah · doi:10.33096/ilkom.v13i3.863.235-243 · Cited by 7
Intelligent Gamification Mechanics Using Fuzzy‐AHP and K‐Means to Provide Matched Partner Reference
Marisa, ., Ahmad, S. S. S., Kausar, N., Kousar, S., Pamucar, D. S., & Ide, N. A. D. (2022) · Discrete Dynamics in Nature and Society · doi:10.1155/2022/8292991 · Cited by 7
Hayajneh, K. F., Abualkishik, F., Bani‐Hani, K., Shakhatreh, H., & Albataineh, Z. M. (2023) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.4818 · Cited by 7
Moreira, M. Â. L., de Souza, G. V. P., Costa, I. P. D. A., Tarantin, W., Fávero, L. P. L., dos Santos, M., & Gomes, C. F. S. (2023) · Procedia Computer Science · doi:10.1016/j.procs.2023.08.039 · Cited by 7
ВИБІР МЕТОДА КЛАСТЕРИЗАЦІЇ З МЕТОЮ АНАЛІЗУ ПОКАЗНИКІВ ЦИФРОВИХ ТРАНСФОРМАЦІЙ РЕГІОНІВ УКРАЇНИ
Барченко, Н. Л., Liubchak, V., & ВЕЛИКОДНИЙ, Д. (2023) · INFORMATION TECHNOLOGY AND SOCIETY · doi:10.32689/maup.it.2023.2.1 · Cited by 7
Chanfreut, P., Maestre, J. M., Krishnamoorthy, D., & Camacho, E. F. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383426 · Cited by 7
“Without loss of generality, we consider the well-known centroid-based algorithm K -means [20], together with the elbow method to select the optimal number of clusters.”
MethodData analysis of music preferences of web users based on social and demographic factors
Shakhovska, N., & Федушко, С. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2021.12.314 · Cited by 7
Wang, F., Liu, X., Chen, T., Feng, H., & Lin, Q. (2025) · Journal of Marine Science and Engineering · doi:10.3390/jmse13050905 · Cited by 7
Li, X., Li, Y.-C., You, H.-R., Shang, X., Wong, L., Huang, Z.-A., You, Z.-H., & Huang, Y. (2025) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2025.3604169 · Cited by 8
“Specifically, two widely used unsupervised clustering methods K-means [42] and Seurat [43] were selected for detailed experiments and comparative analysis.”
Unsupervised document and template clustering using multimodal embeddings
Sampaio, P. R., & Maxcici, H. (2026) · International Journal on Document Analysis and Recognition (IJDAR) · doi:10.1007/s10032-026-00591-9 · Cited by 6
“k -Means [8–10] is a centroid-based partitioning algorithm that aims to divide n samples into k clusters by iteratively assigning each sample to the cluster with the nearest mean (centroid).”
Deep learning-based forest fire detection using an improved SSD algorithm with CBAM
Zhang, D., Zhang, Y., Dong, L., Ruan, S., & Liu, Z. (2025) · PLoS ONE · doi:10.1371/journal.pone.0333574 · Cited by 6
“Alexey Bochkovskiy and colleagues [8], aiming to maintain model lightweightness, adopted the YOLOv4-Tiny algorithm.”
Liu, T., Luo, Y. T., Pang, P. C., Wong, D., & Wang, Y. (2025) · BMC Public Health · doi:10.1186/s12889-025-25847-7 · Cited by 6
“However, its performance is limited when dealing with high-dimensional nonlinear data [40].”
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)

