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 801–900 of 1,001
Brain Storm Optimization based Swarm Learning for Diabetic Retinopathy Image Classification
Qu, L., Wang, C., & Shi, Y. (2024) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612118 · Cited by 3
“Specifically, we employ the k-means algorithm [41] to cluster the |H| clients into a set of clusters.”
MethodSoft Partitioning of Latent Space for Semantic Channel Equalization
Hüttebräucker, T., Sana, M., & Strinati, E. C. (2024) · International Symposium on Wireless Communication Systems · doi:10.1109/iswcs61526.2024.10639062 · Cited by 3
“In our work we choose to use the well known k-means algorithm [12].”
MethodMulti-Stage Defense: Enhancing Robustness in Sequence-Based Log Anomaly Detection
Tan, K., Zhan, D., Yu, Z., Ye, L., Zhang, H., & Fang, B. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622485 · Cited by 4
“In this step, the semantic vectors are subsequently clustered into events, utilizing the K-Means algorithm [8].”
MethodCharacterizing Near-Surface Velocity Structures via Deep Learning
Li, Z., Jia, X., Zhang, J., Zhu, P., Cai, W., Zhang, H., & Liao, Z. (2024) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2024.3454371 · Cited by 3
“While having advantages in unlabeled datasets, the accuracy and efficiency of the k -means method remain subject to undetermined parameters [16].”
MethodHu, J., & Xiao, W. J. (2024) · Sustainability · doi:10.3390/su16198399 · Cited by 4
“…Correlation, and Importance Analysis In the third phase, to investigate the types of engagement, performance, and satisfaction among online self-directed professional learners, we employed the unsupervised K-means algorithm [30] to cluster the meaningful features generated in the second phase.”
Du, M., Ren, Y., Zhang, Y., Li, W., Yang, H., Chu, H., & Zhao, Y. (2024) · Interdisciplinary Sciences Computational Life Sciences · doi:10.1007/s12539-024-00656-5 · Cited by 3
“…level and charted a phylogram through the following steps: (i) calculating centroids of binary feature vectors for all BGCs in each GCF using K-means [45]; (ii) performing average-linkage agglomerative [46] clustering analysis (Euclidean distance) on these centroids to generate a hierarchical tree.”
On the Use of Machine Learning and Key Performance Indicators for Urban Planning and Design
Ammouriova, M., Tsertsvadze, V., Juan, A. A., Fernández, T., & Kapetas, L. (2024) · Applied Sciences · doi:10.3390/app14209501 · Cited by 3
“This iterative process continues until the centroids converge, i.e., when they do not show significant changes in successive iterations, thus ensuring the optimality of the data partitioning [36].”
Liao, H. H., Su, Q., & Chiang, K. (2024) · Journal of Mechanics · doi:10.1093/jom/ufae042 · Cited by 3
Wang, D., Dong, J., Tang, L., Ma, M., & Xie, T. (2024) · Journal of Marine Science and Engineering · doi:10.3390/jmse12122299 · Cited by 3
Comparison of EEG Preprocessing Techniques for Complexity Measures in Alzheimer's Disease Detection
Arpaïa, P., Cacciapuoti, M., Cataldo, A., Criscuolo, S., Benedetto, E. D., Masciullo, A., Pesola, M., & Schiavoni, R. (2024) · IEEE International Conference on Metrology for eXtended Reality, Artificial Intelligence and Neural Engineering (MetroXRAINE) · doi:10.1109/metroxraine62247.2024.10797076 · Cited by 3
“3) Clusterization: k-means algorithm [15] was employed as a clustering technique to identify different patterns in HS and AD data.”
Ma, M., Jiang, W., Liu, J., Du, L., Ma, Z., & Du, Y. (2024) · IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) · doi:10.1109/apccas62602.2024.10808813 · Cited by 3
Analysis of deep non-smooth symmetric nonnegative matrix factorization on hierarchical clustering
Li, S., Lu, L., Liu, Q., & Chen, Z. (2025) · Applied Intelligence · doi:10.1007/s10489-025-06367-8 · Cited by 3
“Feature extraction is a pivotal aspect of data analysis, with methods such as k-means clustering [1, 2], principal component analysis (PCA) [3], and linear discriminant analysis the feature representation matrix (coefficient matrix), respectively.”
Factors influencing student engagement and behavioral differences based on K-means cluster analysis
Li, W., & Xue, Z. (2024) · Journal of Computational Methods in Sciences and Engineering · doi:10.1177/14727978241305758 · Cited by 4
Oktorina, F. K., Zulfikar, Am, A. N., Nurkholis, & Pramono, A. (2025) · Jurnal Penelitian Pendidikan IPA · doi:10.29303/jppipa.v11i4.10975 · Cited by 3
“The aim of this study is to cluster the welfare levels of oil palm farmers in Gading Sari Village, Tapung, using the K-Means Clustering algorithm (Ahmed et al., 2020).”
Winarno, W. (2023) · Jurnal Teknologi Informasi dan Pendidikan · doi:10.24036/jtip.v16i1.668 · Cited by 3
“Evaluation is a crucial aspect in ensuring the quality of an algorithm [13].”
BackgroundRahman, A., Yu, A., & Cho, K. (2026) · Systems · doi:10.3390/systems14020175 · Cited by 2
Optimized YOLOv7 for Small Target Detection in Aerial Images Captured by Drone
Liu, Y., Chen, S., & Luo, L. (2023) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2023.0140909 · Cited by 2
“Genetic Kmeans (1-IoU) algorithm utilizes genetic algorithms to optimize Kmeans clustering [20].”
MethodZhu, Y., Yang, L., Yang, X., Xu, F., Su, Z., & Zhen, Z. (2023) · IEEE International Conference on Energy Technologies for Future Grids (ETFG) · doi:10.1109/etfg55873.2023.10407888 · Cited by 2
“…clustering center; Step 3: Update the cluster class mean vector according to the cluster to which each sample belongs, using the following formula[15]: where L is the number of samples in class cluster k C ; Step 4: Compute the Euclidean distance between each sample and the updated cluster…”
InfluentialSaputra, A. B., Sanjaya, U. P., & Sa’ida, I. A. (2024) · Jurnal Ilmiah Informatika Global · doi:10.36982/jiig.v15i2.4359 · Cited by 2
“Clustering merupakan proses mengeksploitasi struktur yang mendasari distribusi data dan menentukan aturan untuk mengelompokkan data dengan karakteristik yang serupa (Ahmed et al., 2020).”
Many-Objective Cover Problem: Discovering Few Solutions to Cover Many Objectives
Liu, Y., Lu, C., Lin, X., & Zhang, Q. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-70085-9_5 · Cited by 2
ANALISIS KESUBURAN PERTANIAN MELALUI IRIGASI DENGAN MENGGUNAKAN METODE K-MEANS CLUSTERING
Fakultas Ilmu Komputer, U. M. R., Mukhtar, H., Syafutri, T. M., Fakultas Ilmu Komputer, U. M. R., Rahman, R. A., Fakultas Ilmu Komputer, U. M. R., Putra, A., Fakultas Ilmu Komputer, U. M. R., Hafsari, R., & Fakultas Ilmu Komputer, U. M. R. (2021) · Journal of Software Engineering and Information Systems · doi:10.37859/seis.v4i2.7599 · Cited by 2
Ju, X., Zhou, C., Xu, Y., & Liang, L. (2024) · Composite Structures · doi:10.1016/j.compstruct.2024.118564 · Cited by 2
PLG-IQB: Parallel LSTM-GRU with Improved QuickBundles for Vessel Trajectory Prediction
Chen, X., & Yang, J. (2024) · International Conference on Intelligent Computing and Signal Processing (ICSP) · doi:10.1109/icsp62122.2024.10743923 · Cited by 2
“Compared to the O(n^2) time complexity of the DBSCAN algorithm [14] and the O(n×k×t) time complexity of the k-means algorithm [15], QB algorithm does not involve reassignment and updating stages of clustered elements, and there is no need to merge clusters.”
MethodAn Innovative Hybrid Approach Producing Trial Solutions for Global Optimization
Charilogis, V., Kyrou, G., Tsoulos, I. G., & Gianni, A. M. (2024) · Applied Sciences · doi:10.3390/app142210567 · Cited by 2
Cao, J., Li, H., Li, S., He, J., & Li, Z. (2024) · Journal of Bionic Engineering · doi:10.1007/s42235-024-00605-4 · Cited by 2
“The colors of the final image are determined by continuously compar - ing the similarities between all colors in the image, ensuring that they can adequately express the image’s features [ 33].”
Gonten, F. N., Gital, A. Y., Useni, D., Suwa, L., & Yerima, M. J. (2024) · International Journal of Advanced Engineering and Nano Technology · doi:10.35940/ijaent.i0484.11121224 · Cited by 2
K-Means Clustering of Social Studies Performance at Junior High School
Tundo, T., Raihanah, S., Wahyudi, T., & Sugiyono, S. (2024) · IJID (International Journal on Informatics for Development) · doi:10.14421/ijid.2024.4632 · Cited by 2
“K-means clustering is an effective and simple method for grouping large amounts of data based on similarities between the data points [11].”
Clustering the Academician Knowledge Qualification: K-Means for Performance Measurement Analysis
Yantі, N., Defit, S., & Okfalisa (2024) · IEEE Student Conference on Research and Development (SCOReD) · doi:10.1109/scored64708.2024.10872735 · Cited by 3
Karbouj, B., Mensing, F., & Krüger, J. (2025) · Procedia CIRP · doi:10.1016/j.procir.2024.09.017 · Cited by 2
Fantozzi, P., Ficcadenti, V., & Naldi, M. (2025) · Scientometrics · doi:10.1007/s11192-025-05263-9 · Cited by 3
“Then, we apply the k-means algorithm to cluster these vectors, with the number of clusters equal to 4 (the number of classes in the ranking) Ahmed et al. (2020).”
Sports competition data analysis and strategy optimization using K-means clustering algorithm
An, N. (2025) · Journal of Computational Methods in Sciences and Engineering · doi:10.1177/14727978251321959 · Cited by 2
“19,20 In competition data analysis, clustering algorithms are used to divide competition data into several clusters, effectively identifying the characteristics of participating players and teams.”
Ермачков, Г. Р., & Nezevak, V. L. (2024) · Journal of Fuzzy Systems and Control · doi:10.59247/jfsc.v3i1.270 · Cited by 2
“Clustering methods, such as k-means, can be useful for separating different color regions [20].”
Mihevc, A., & Podržaj, P. (2025) · International Symposium INFOTEH-JAHORINA (INFOTEH) · doi:10.1109/infoteh64129.2025.10959278 · Cited by 2
Enhancing Imbalanced Data Handling Using MWMOTE and K-Means Clustering
Untoro, M. C. (2025) · Indonesian Journal of Electronics Electromedical Engineering and Medical Informatics · doi:10.35882/ijeeemi.v7i2.69 · Cited by 2
“This gap offers an opportunity to explore how clustering methods, such as K-Means clustering, can be used to better distribute synthetic instances across the feature space, reducing overlap and improving class separation [23].”
Alonso-Sastre, A.-I., Pardo, J., Cortijo, O., & Falcó, A. (2025) · Merits · doi:10.3390/merits5020014 · Cited by 2
Pheromone Mutation-Based Ant Colony Optimization for Multiple Traveling Salesman Problem
Gao, M., Yu, W., Sun, B., Qian, T., & Bai, Y. (2025) · International Conference on Machine Intelligence Theory and Applications (MiTA) · doi:10.1109/mita66017.2025.11100229 · Cited by 2
“In the upper layer, K-means clustering method [18] is used to assign n cities to m salesmen.”
Analysis of Multivariate Indoor Building Data: A Comparative Study of Time-Series Clustering Methods
Ngo, Q.-D., & Phan, L. (2025) · IEEE Access · doi:10.1109/access.2025.3596297 · Cited by 2
Research on laser damage detection in DKDP crystals based on machine learning and image processing
Zhu, X., Lian, Y., Feng, X., Shao, J., & Zhao, Y. (2025) · Optical Materials · doi:10.1016/j.optmat.2025.117379 · Cited by 2
Optimizing the temporal adjacency matrix for 3D human pose estimation through clustering
Wang, Y., Li, M., Meng, N., & Xu, M. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.131247 · Cited by 2
Unsupervised fake news detection on social media using hybrid Gaussian Mixture Model
Perveen, S., Shahbaz, M., Albouq, S., Shinan, K., Alhazmi, H. E., Alanazi, F., Ashraf, M., & Ashraf, R. (2025) · PLoS ONE · doi:10.1371/journal.pone.0330421 · Cited by 2
“During this partitioning process, each cluster finds its representation through a centroid point based on a distance metric [110].”
Farisi, I. M., & Supatmi, S. (2024) · International Conference on Informatics Engineering, Science & Technology (INCITEST) · doi:10.1109/incitest64888.2024.11121472 · Cited by 2
“The coefficient values from each iteration are compared to identify significant changes from high to low, which, when graphed, resemble an elbow shape [14].”
Masked and Clustered Pre-Training for Geosynchronous Satellite Maneuver Detection
Tian, S.-H., Fang, Y.-Q., Diao, H., Luo, D., & Zhang, Y. (2025) · Remote Sensing · doi:10.3390/rs17172994 · Cited by 2
Yu, S., Bi, J., Guan, R., & Liu, K. (2025) · International Conference on Electrical Technology and Automatic Control (ICETAC) · doi:10.1109/icetac65964.2025.11144273 · Cited by 2
Automatic generation of learning path for teaching informatics at university
Aliyeva, A., & Abbasov, A. M. (2025) · MethodsX · doi:10.1016/j.mex.2025.103634 · Cited by 2
“The K-Means algorithm is a classical method in cluster analysis [21].”
Distributed Two-Tier Cache Optimization in Metaverse Scenarios Combining MADDPG and GCN
Wan, Z., Zhao, S., Dong, X., Liu, X., Tan, Y. X., & Fang, Y. (2025) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2025.3613168 · Cited by 2
“The FastDTW algorithm is employed to measure the similarity of subsequences of varying lengths, and K-Means clustering [14] is used to perform real-time prediction of trajectory segments, thereby supporting caching strategy optimization.”
Data Mining Scheme for Globally Distributed Big Data
Kim, J., Park, K., & Ma, Y. (2025) · Journal of Computer Information Systems · doi:10.1080/08874417.2025.2564437 · Cited by 2
Traversal Learning Coordination for Lossless and Efficient Distributed Learning
Batbaatar, E., Kim, J., Kim, Y., & Yoon, Y. (2025) · Expert Systems · doi:10.1111/exsy.70141 · Cited by 2
“Specifically, we used the MIMIC-IV (Xie et al. 2022) dataset from the medical domain and the Bank Marketing (Moro et al. 2014) dataset from the financial domain.”
EmbodiedFly: Embodied LLM Agent with an Autonomous Reconfigurable Drone
Zhao, M., Hou, K., Xia, J., Liu, Y., Xia, S., & Jiang, X. (2025) · ACM Transactions on Internet of Things · doi:10.1145/3772079 · Cited by 2
Hou, C., Yang, Y., Chen, W., Yang, L., Zeng, Y., Li, Q., & Song, H. (2025) · Depression and Anxiety · doi:10.1155/da/3990416 · Cited by 2
“In addition to the UMAP-HDBSCAN methods, we applied traditional unsupervised machine learning techniques, including K -means [37] and hierarchical clustering [38], to identify preoperative psychological patterns.”
KPIs Anomaly Detection: A Comparative Analysis of Algorithms and Models
Duan, Z., Xi, M., Zhou, C., & Su, M. (2025) · doi:10.1109/icbdse65491.2025.11220055 · Cited by 2
“K-means clustering algorithm[9] is a kind of iterative clustering analysis method, which divides data points into different behavior patterns through clustering analysis, and identifies clusters that are significantly different from ' normal ' patterns as anomalies.”
Climate change will greatly alter multifaceted biodiversity patterns in goatfish species
Huang, H., Qin, G., Zhang, Z., & Lin, Q. (2025) · npj Biodiversity · doi:10.1038/s44185-025-00113-6 · Cited by 2
“To understand whether the responses of different goat fi sh to environmental factors are similar, we run a cluster using the K-Means algorithm analysis 77 with species association coef fi cients to have an indicative of possible groups of species that may show similar response.”
Mwangi, M. G. W., Park, M.-H., Chun, K. W., Noh, J.-H., Kim, C., & Lee, W.-J. (2025) · Journal of Ocean Engineering and Science · doi:10.1016/j.joes.2025.12.002 · Cited by 5
Adaptive Petri Net Token Flow Approach for Enhanced Grayscale Image Segmentation
Mahadeer, A., Arulprakasam, R., Gurusamy, R., & Shang, Y. (2025) · IET Image Processing · doi:10.1049/ipr2.70255 · Cited by 2
Yue, H., Cao, K., Yang, Z., An, Q., & Sun, L. (2025) · Scientific Reports · doi:10.1038/s41598-025-32839-5 · Cited by 2
“The mean grayscale of each category is used as the initial cluster center 41 .”
Harnessing Temporal Awareness: Dual-CNN Model for Non-Intrusive Load Monitoring
Wu, H., 業春, 阮., & Huang, Q. (2025) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2025.3609569 · Cited by 2
“Then, we employed the K-Means clustering algorithm [31] to further divide the ON state of the appliance into di ff erent active levels.”
CAST: Cluster-Driven Truthful Crowdfunding Mechanism for Shared AI Service Deployment
Liu, H., Wang, M., Liu, J., Yuan, S., Lou, J., Wu, C., & Li, J. (2025) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2025.3618892 · Cited by 2
“Our Adaptive DBSCAN ( AdpDBS ) and Utility Potential Bayesian Clustering( UPBC ) schemes are compared against baselines: DBSCAN ( DBS ) [49], K-means [58], Unsupervised K-means (UKmeans) [47], Random cluster , and No cluster .”
Wang, Z., Jiang, C., & Wang, K. (2025) · Multimedia Systems · doi:10.1007/s00530-025-02107-7 · Cited by 2
“To evaluate the learning quality of each encoder, we apply the K-Means clustering algorithm [ 1, 26 ] separately to each feature space.”
Abdulhamid, U. F., Ahmad, M. A., & Ibrahim, M. A. (2025) · UMYU Scientifica · doi:10.56919/usci.2544.001 · Cited by 2
“One of the most popular and successful algorithms in data mining and research is K-means, implemented in the scikit-learn Python library (Ahmed et al., 2020).”
Dratwińska-Kania, B., & Karmańska, A. M. (2025) · Sustainability · doi:10.3390/su18010162 · Cited by 2
BASCULE: bayesian inference and clustering of mutational signatures leveraging biological priors
Buscaroli, E., Sadr, A., Bergamin, R., Milite, S., Garcia, E. N. V., Tasciotti, A., Ansuini, A., Ramazzotti, D., Calonaci, N., & Caravagna, G. (2025) · Genome biology · doi:10.1186/s13059-025-03835-9 · Cited by 3
“These results suggest that BASCULE can scale efficiently to analyse large cohorts.”
Optimized Task Offloading and Result Caching in Compute-Storage Cooperative Edge Networks
Zhu, T., Li, Y., Fang, X., Li, Y., Luo, J., & Cai, Z. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3649412 · Cited by 4
“We use clustering algorithm [42] to partition the coordinate data into several clusters based on spatial distance.”
Zhou, R., Liu, Y., He, Y., Liang, J., Chen, M., Chen, N., Jia, F., & Hou, C. (2026) · Asia-Pacific Psychiatry · doi:10.1111/appy.70011 · Cited by 2
Song, S., & Yang, S. (2026) · Journal of King Saud University - Computer and Information Sciences · doi:10.1007/s44443-026-00494-z · Cited by 2
Mo, W., Zheng, H., Lv, Y., Yuan, H., Fan, X., Peng, D., & Chen, H. J. (2026) · World Electric Vehicle Journal · doi:10.3390/wevj17020064 · Cited by 2
Su, Z., Zhen, Z., Wang, F., Xu, F., Yang, X., Zhu, Y., & Yang, L. (2026) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2026.3660788 · Cited by 2
“Traditional K-means clustering methods [27] rely on the similarity of the shape and magnitude of the power curves for cluster division, and this subregion division method based on intuitive similarity is difficult to reveal the intrinsic consistency and convergence of the output power of the…”
Karagiannidou, M., Vasilakos, C., Kokinou, E., & Gerarchakis, N. (2026) · Remote Sensing · doi:10.3390/rs18030501 · Cited by 2
UAV Placement Optimization and Data Collection for Wireless Sensor Networks
Elidrissi, A., Casado, R., Haqiq, A., & Orozco–Barbosa, L. (2026) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-026-02359-z · Cited by 3
“The K -means algorithm iteratively updates the positions of the HLs by calculating the mean positions of sensors within a specific cluster, starting with K = 1 and incrementing K until all sensors are grouped into clusters with a radius of R [25].”
Sarath, S., Sachin, S. M., Sunitha, E. V., & Nair, J. J. (2026) · Smart Agricultural Technology · doi:10.1016/j.atech.2026.101865 · Cited by 2
Wang, Z. Y., Zhang, J., Wang, Z., Zhou, X., & Bai, Z. (2026) · Measurement · doi:10.1016/j.measurement.2026.120833 · Cited by 2
Liu, S., Feng, Q., Ai, W., Chen, H., & Lin, B. (2026) · Egyptian Informatics Journal · doi:10.1016/j.eij.2026.100911 · Cited by 2
Dynamic target-aware multi-objective reinforcement clustering for intelligent fault diagnosis
Wang, R., Jiang, Z., Huang, M., Shao, H., & Fu, J. (2026) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2026.114014 · Cited by 2
Mucherino, S., Orlando, V., Vervloet, M., Weesie, Y. M., van Dijk, L., & Menditto, E. (2026) · PLoS ONE · doi:10.1371/journal.pone.0342056 · Cited by 2
“Sensitivity analyses confirmed the selection [22–24].”
InfluentialKim, J., Shin, W., Hwang, J., Kwon, J., Song, S., & Min, K. (2026) · Journal of Materials Chemistry A · doi:10.1039/d5ta09736c · Cited by 2
Nji, F. N., Janeja, V. P., & Wang, J. (2025) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw69685.2025.00073 · Cited by 2
“Let us assume that n atmospheric variables ( x i ) are measured over a grid region covering L longitudes and W latitudes and stored in a vector X = { x 1 , x 2 , x 3 , . . . , x n } .”
Wu, Y., Yang, X., Zhang, Z., & Ding, S. (2026) · Biomass and Bioenergy · doi:10.1016/j.biombioe.2026.109350 · Cited by 2
Han, F., Cheng, X., Ling, Q.-H., Han, H., Liu, H., & Liu, Q. (2026) · International Journal of Data Science and Analytics · doi:10.1007/s41060-026-01093-x · Cited by 2
Hao, X., Li, G., Wu, D., Guo, X., Zhu, Y., Zou, Z., Zhen, 彭. P., Yao, Y., & Liang, Y. (2026) · International World Wide Web Conference (WWW) · doi:10.1145/3774904.3792789 · Cited by 2
“Subsequently, we employed the K-Means algorithm [3] to partition the region representations into 10 clusters.”
Lin, L., Lan, M., Xiao, F., Wang, Q., Wang, D., Zhao, J., & He, W. (2026) · Journal of Climate · doi:10.1175/jcli-d-25-0331.1 · Cited by 2
Automated reverse modeling of point clouds for weld-oriented representation of complex steel joints
Teng, W., Qi, H., Yang, Z., & Yin, H. (2026) · Automation in Construction · doi:10.1016/j.autcon.2026.106955 · Cited by 2
Model Editing for New Document Integration in Generative Information Retrieval
Zhang, Z. C., Wang, Z., Ma, X., Wang, S., Yin, D., Xin, X., Ren, P., de Rijke, M., & Ren, Z. (2026) · International World Wide Web Conference (WWW) · doi:10.1145/3774904.3792178 · Cited by 6
“These tokens are often assigned via structured schemes such as hierarchical 𝑘 -means clustering [1].”
Chen, L., Zeng, Y., Wang, Y., Wan, P., Ning, G., Liao, H., Zhang, D., & Chen, F. (2025) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51701.2025.01993 · Cited by 4
“Specifically, we first employ K-means [1] for fine-grained clustering : Let A represent the learned cluster centroids, where the number of fine-grained clusters, m = | A | is assigned an elevated value to ensure each centroid optimally encapsulates semantically cohesive representations of its…”
Gong, T., Zhou, J., & Wang, X. (2026) · Journal of Materials Chemistry C · doi:10.1039/d6tc00745g · Cited by 2
Çelik, S., & Köroğlu, C. Z. (2026) · Frontiers in Public Health · doi:10.3389/fpubh.2026.1841479 · Cited by 2
Prioritizing Causes of Construction Delays: A Global Comparative Analysis Using PRISMA Methodology
Zagia, F., Kajewski, S. L., Omrani, S., & Motamedisedeh, O. (2026) · Lecture notes in civil engineering · doi:10.1007/978-981-95-8872-5_43 · Cited by 2
Alasi, G., & Putri, R. A. (2025) · Jurnal Multimedia dan Teknologi Informasi (Jatilima) · doi:10.54209/jatilima.v7i03.1598 · Cited by 2
Li, J., Li, M., Cao, Q., Liu, S., & Wei, C. (2021) · Journal of Imaging Science and Technology · doi:10.2352/j.imagingsci.technol.2022.66.2.020410 · Cited by 2
Wu, J. (2022) · Security and Communication Networks · doi:10.1155/2022/9091208 · Cited by 2
RetractedResearch on Animation Character Based on the Semantic Segmentation Model
Huang, X., Zhang, J., & Wu, S. (2022) · Scientific Programming · doi:10.1155/2022/3288626 · Cited by 2
Unsupervised anomaly data detection for wind turbines based on time series
Zhang, T., Chen, M., Chen, H., & Wu, C. (2022) · IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC) · doi:10.1109/itaic54216.2022.9836648 · Cited by 2
Shcherbakov, G. D., & Bessonov, V. V. (2022) · ЗДОРОВЬЕ НАСЕЛЕНИЯ И СРЕДА ОБИТАНИЯ - ЗНиСО / PUBLIC HEALTH AND LIFE ENVIRONMENT · doi:10.35627/2219-5238/2022-30-8-64-72 · Cited by 2
Improving human living environment and human health through environmental digital twins technology
Lv, Z., & Chen, D. (2023) · Elsevier eBooks · doi:10.1016/b978-0-32-399163-6.00013-5 · Cited by 2
Comparative Analysis of K-means and Hierarchical Clustering in Bigdata Environment
Maruthi, P. B., & Bilas, P. (2022) · International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS) · doi:10.1109/csitss57437.2022.10026370 · Cited by 2
Unsupervised K-means for Energy Conservation in IoT Networks
Merah, M., & Aliouat, Z. (2022) · International Conference on Computer Communications and Intelligent Systems (I3CIS) · doi:10.1109/i3cis56626.2022.10075898 · Cited by 2
“Among them is the K-means algorithm [7], which has proven to be very effective in producing clusters for different practical applications, notably WSNs and non-uniformly distributed networks in general.”
MethodChandra, A., Saindane, S. S., & Murali, S. (2023) · Applied Radiation and Isotopes · doi:10.1016/j.apradiso.2023.110878 · Cited by 2
Huang, J., & Chen, W.-T. (2023) · IEEE International Conference on Power, Intelligent Computing and Systems (ICPICS) · doi:10.1109/icpics58376.2023.10235522 · Cited by 2
Yu, X. (2023) · Applied Mathematics and Nonlinear Sciences · doi:10.2478/amns.2023.2.00221 · Cited by 2
Perles, A., Ngo, H.-N., Kaddoum, E., & Camps, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-46846-9_5 · Cited by 2
Design and Development of a Semi-Automated Kitchen Waste Composter
Adique, M. C. N., Mandap, A. J. L., Guico, M. L. C., & Galicia, J. K. A. (2023) · International Conference on Computer and Communication Engineering · doi:10.1109/iccce58854.2023.10246029 · Cited by 2
“Each cluster will have a center and this method minimizes the mean Euclidean distance or the variance within each[11] .”
MethodA Review on Appropriateness of Partitional Clustering Algorithms in Handling Transactional Data
Lubis, A. H., & Ramayana, E. (2023) · International Journal of Research and Review · doi:10.52403/ijrr.20230918 · Cited by 2
Cluster Fusion Training: Exploring Cluster Analysis to Enhance Cross-Domain Sentiment Classification
Tomita, V. A. K., da Silva, A. C. M., & Marcacini, R. M. (2023) · doi:10.5753/eniac.2023.234035 · Cited by 4
“Para isso, prop˜oe-se o uso do algoritmo k-means [Ahmed et al. 2020] para realizar o clustering dos dados, juntamente com o modelo de linguagem pr´e-treinado MiniLM-v2 [Wang et al. 2020] para a extrac¸˜ao das representac¸˜oes textuais.”
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)

