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.”
The global k-means clustering algorithm
Likas, A., Vlassis, N., & J. Verbeek, J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00060-2 · Cited by 3,733 · cited 1×
“Experimental analysis with k-means [9], x-means [49], constrained k-means [54], k-prototype [63], and kernel k-means [74] was performed, and a performance comparison in terms of the metrics described above was made.”
A massively parallel architecture for a self-organizing neural pattern recognition machine
Carpenter, G. A., & Grossberg, S. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80014-2 · Cited by 2,525 · cited 1×
“A similar strategy is also adopted in adaptive resonance theory [47], which generates new clusters [48].”
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Huang, Z. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009769707641 · Cited by 2,505 · cited 2×
“Huang et al. in [63] provided a variant of the k-means algorithm, where a dissimilarity measure is used as a metric.”
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Cluster analysis of multivariate data : efficiency versus interpretability of classifications
Forgy, E. W. (1965) · Biometrics · Cited by 2,093
Stanfill, C., & Waltz, D. (1986) · Communications of the ACM · doi:10.1145/7902.7906 · Cited by 1,218 · cited 1×
“Among many proposed measures [67–69], the overlap measure is considered to be the easiest and most computationally efficient method to find similarity between two categorical attributes [70].”
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
A clustering technique for summarizing multivariate data
Ball, G. H., & Hall, D. J. (1967) · Behavioral Science · doi:10.1002/bs.3830120210 · Cited by 912 · cited 1×
“Ball et al. [46] proposed the ISODATA algorithm to estimate k by parameter tweaking.”
An empirical comparison of four initialization methods for the K-Means algorithm
Peña, J. M., Lozano, J. A., & Larrañaga, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00069-0 · Cited by 866 · cited 1×
“In [55], the author empirically compared four initialization methods.”
A survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827 · cited 1×
“Yang [38] X × × × Filippone [39] X × × ×”
A k-mean clustering algorithm for mixed numeric and categorical data
Ahmad, A., & Dey, L. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.016 · Cited by 718 · cited 1×
“Amir et al. [61] offered a cost function and distance measure for clustering datasets with mixed data (datasets with numerical and categorical data) based on co-occurrences of values.”
An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
Jing, L., Ng, M. K., & Huang, J. Z. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1048 · Cited by 625 · cited 1×
“In [66], an entropy weighting k-means (EWKM) clustering algorithm was presented for clustering sparse datasets with high dimensions.”
Similarity Measures for Categorical Data: A Comparative Evaluation
Boriah, S., Chandola, V., & Kumar, V. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.22 · Cited by 575 · cited 1×
“However, after a thorough experimental analysis in [71] on a number of datasets, the authors came to the conclusion that “No single measure is always superior or inferior.”
A survey of anomaly detection techniques in financial domain
Ahmed, M., Mahmood, A. N., & Islam, M. R. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2015.01.001 · Cited by 528 · cited 1×
“A plethora of clustering techniques have been invented in the last decade, which are being applied in a wide range of application domains [8].”
Self-citationYang, M.-S. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90202-a · Cited by 506 · cited 1×
“Yang [38] X × × × Filippone [39] X × × ×”
Xu, R., & Wunsch, D. C. (2008) · Wiley eBooks · doi:10.1002/9780470382776 · Cited by 406
A modified version of the K-means algorithm with a distance based on cluster symmetry
Su, M.-C., & Chou, C.-H. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927466 · Cited by 389 · cited 1×
“[10] Face detection Symmetry-based version of k-means (SBKM).”
Qin, J., Fu, W., Gao, H., & Zheng, W. X. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2526683 · Cited by 333
A Survey of Clustering Techniques
Rai, P., & Singh, S. (2010) · International Journal of Computer Applications · doi:10.5120/1326-1808 · Cited by 222
A Sober Look at Clustering Stability
Ben-David, S., von Luxburg, U., & Pál, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11776420_4 · Cited by 216 · cited 1×
“In [43], the authors discussed criteria concerning the stability and the performance of the k-means.”
Spectral Ensemble Clustering via Weighted K-Means: Theoretical and Practical Evidence
Liu, H., Wu, J., Liu, T., Tao, D., & Fu, Y. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2650229 · Cited by 198 · cited 1×
“[14] Partial multiview data Weighted k-means.”
Semi-Supervised K-Means DDoS Detection Method Using Hybrid Feature Selection Algorithm
Gu, Y., Li, K., Guo, Z., & Wang, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2917532 · Cited by 161
Wu, W., & Peng, M. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2677578 · Cited by 160
Re-Weighted Discriminatively Embedded $K$ -Means for Multi-View Clustering
Xu, J., Han, J., Nie, F., & Li, X. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2665976 · Cited by 147
A Linear Time-Complexity k-Means Algorithm Using Cluster Shifting
Pakhira, M. K. (2014) · International Conference on Computational Intelligence and Communication Networks (CICN) · doi:10.1109/cicn.2014.220 · Cited by 143 · cited 1×
“However, it can be optimized to be linear and be in the order of O(n) using certain heuristics mentioned in [75,76].”
Hierarchical K-means Method for Clustering Large-Scale Advanced Metering Infrastructure Data
Xu, T.-S., Chiang, H., Liu, G., & Tan, C. (2015) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2015.2479941 · Cited by 120 · cited 1×
“[12] Load pattern Hierarchical k-means (H-Kmeans).”
DeepCluster: A General Clustering Framework Based on Deep Learning
Tian, K., Zhou, S., & Guan, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71246-8_49 · Cited by 109 · cited 2×
“This overcomes the problem that exists when useful information from images is lost by repeated convolution of the images [36].”
Revisiting K-Means and Topic Modeling, a Comparison Study to Cluster Arabic Documents
Alhawarat, M. O., & Hegazi, M. O. (2018) · IEEE Access · doi:10.1109/access.2018.2852648 · Cited by 105 · cited 1×
“[27] Text processing Vanilla k-means .”
Ahmed, M. (2018) · Knowledge and Information Systems · doi:10.1007/s10115-018-1183-0 · Cited by 88 · cited 2×
“This paper will also help the data mining research community to design and develop newer types of clustering algorithms that can address the research issues around Big Data [34,72].”
Self-citationFast Adaptive K-Means Subspace Clustering for High-Dimensional Data
Wang, X., Chen, R.-C., Yan, F., Zeng, Z., & Hong, C. (2019) · IEEE Access · doi:10.1109/access.2019.2907043 · Cited by 88 · cited 1×
“[28] High dimensional data processing Fast adaptive k-means (FAKM).”
A k-means based co-clustering (kCC) algorithm for sparse, high dimensional data
Hussain, S. F., & Haris, M. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.09.006 · Cited by 87 · cited 1×
“Recently, in [58], a co-clustering algorithm is proposed for dealing with sparse and high dimensional data that outperforms the basic k-means .”
K-means Clustering Algorithm for Categorical Attributes
Gupta, S. K., Rao, K. S., & Bhatnagar, V. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48298-9_22 · Cited by 81 · cited 1×
“In many application domains, datasets include attributes that are of mixed data types [59].”
Maung, K. (1941) · Annals of Eugenics · doi:10.1111/j.1469-1809.1941.tb02285.x · Cited by 79
Practical Privacy-Preserving MapReduce Based K-Means Clustering Over Large-Scale Dataset
Yuan, J., & Tian, Y. (2017) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2017.2656895 · Cited by 78 · cited 1×
“[17] Big data Privacy preserving k-means .”
Anomaly Detection on Big Data in Financial Markets
Ahmed, M., Choudhury, N., & Uddin, S. (2017) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3110025.3119402 · Cited by 74 · cited 1×
“It is also studied in statistics, pattern recognition, computational geometry, bioinformatics, optimization, image processing, and in a variety of other fields [4–7].”
Self-citationOn -means algorithm with the use of Mahalanobis distances
Melnykov, I. V., & Melnykov, V. (2013) · Statistics & Probability Letters · doi:10.1016/j.spl.2013.09.026 · Cited by 72
Kernel K-Means Sampling for Nyström Approximation
He, L., & Zhang, H. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2796860 · Cited by 63 · cited 1×
“[22] Image segmentation.”
The Elements of Probability Theory and Some of Its Applications
(1955) · AIBS Bulletin · doi:10.1093/aibsbulletin/5.2.16 · Cited by 59
How the initialization affects the stability of the қ-means algorithm
Bubeck, S., Meilă, M., & Ulrike Von Luxburg, A. (2012) · ESAIM Probability and Statistics · doi:10.1051/ps/2012013 · Cited by 56
Self-paced Learning for K-means Clustering Algorithm
Yu, H., Wen, G., Gan, J., Zheng, W., & Lei, C. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.08.028 · Cited by 56 · cited 1×
“In [41], an alternative approach was adopted to prevent the k-means algorithm from being easily affected by noise and outlier values.”
Network traffic analysis based on collective anomaly detection
Ahmed, M., & Mahmood, A. N. (2014) · IEEE Conference on Industrial Electronics and Applications (ICIEA) · doi:10.1109/iciea.2014.6931337 · Cited by 44 · cited 1×
“This algorithm was utilized in identifying anomalous patterns in [52,53].”
Self-citationAn ensemble clusterer of multiple fuzzy k-means clusterings to recognize arbitrarily shaped clusters
Bai, L., Liang, J., & Guo, Y. (2018) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2018.2835774 · Cited by 43
Zeng, X., Li, Z., Gao, W., Ren, M., Zhang, J., Li, Z., & Zhang, B. (2018) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2018.2793196 · Cited by 41 · cited 1×
“[21] Sensing for IGBT current k-means with neural network.”
The impact of cluster representatives on the convergence of the K-modes type clustering
Bai, L., Liang, J., Dang, C., & Cao, F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.228 · Cited by 39 · cited 1×
“In [64], the convergence of different versions of the modified k-modes algorithms was analyzed.”
Kwedlo, W., & Czochanski, P. J. (2019) · IEEE Access · doi:10.1109/access.2019.2907885 · Cited by 38
Tag clustering algorithm LMMSK: improved K-means algorithm based on latent semantic analysis
Wang, J. Y. A. J. (2017) · Journal of Systems Engineering and Electronics · doi:10.21629/jsee.2017.02.18 · Cited by 37 · cited 1×
“[20] Social tags k-means based on latent semantic analysis.”
Fuzzy K-Means Using Non-Linear S-Distance
Karlekar, A., Seal, A., Krejcar, O., & Gonzalo‐Martín, C. (2019) · IEEE Access · doi:10.1109/access.2019.2910195 · Cited by 37 · cited 1×
“[31] Adaptive clustering Fuzzy k-means with S-distance.”
Collective Anomaly Detection Techniques for Network Traffic Analysis
Ahmed, M. (2018) · Annals of Data Science · doi:10.1007/s40745-018-0149-0 · Cited by 32 · cited 1×
“Hence, the overlap measure (for categorical attributes) and Euclidean distance (for numerical attributes) can be combined into a mixed distance measure, as also used in [6,72].”
Self-citationKernel K-Means for Categorical Data
Couto, J. (2005) · Lecture notes in computer science · doi:10.1007/11552253_5 · Cited by 27 · cited 1×
“In [62], a kernel function based on “hamming distance” [62] was proposed for embedding categorical data.”
Yang, X., Li, Y., Sun, Y., Long, T., & Sarkar, T. K. (2018) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2018.2823713 · Cited by 27 · cited 1×
“[24] Sound source angle estimation.”
ON THE GENERAL THEORY OF MULTIPLE CONTINGENCY WITH SPECIAL REFERENCE TO PARTIAL CONTINGENCY
Pearson, K. (1916) · Biometrika · doi:10.1093/biomet/11.3.145 · Cited by 25 · cited 1×
“Among many proposed measures [67–69], the overlap measure is considered to be the easiest and most computationally efficient method to find similarity between two categorical attributes [70].”
Manju, V. N., & Fred, A. L. (2017) · IET Image Processing · doi:10.1049/iet-ipr.2017.0430 · Cited by 25 · cited 1×
“[23] Image compression k-means cuckoo optimization.”
Schellekens, V., & Jacques, L. (2018) · IEEE Signal Processing Letters · doi:10.1109/lsp.2018.2847908 · Cited by 25 · cited 1×
“[26] Signal processing Compressive k-means clustering (CKM).”
Infrequent pattern mining in smart healthcare environment using data summarization
Ahmed, M., & Ullah, A. B. (2018) · The Journal of Supercomputing · doi:10.1007/s11227-018-2376-8 · Cited by 25 · cited 1×
“This algorithm was utilized in identifying anomalous patterns in [52,53].”
Self-citationEfficient Multiple Kernel k-Means Clustering With Late Fusion
Wang, S., Zhu, E., Hu, J., Li, M., Zhao, K., Hu, N., & Liu, X. (2019) · IEEE Access · doi:10.1109/access.2019.2904887 · Cited by 25 · cited 1×
“[29] Computational complexity Multiple kernel k-means with late fusion.”
Jang, H., Lee, H., Lee, H., Kim, C., & Chae, H. (2017) · IEEE Transactions on Semiconductor Manufacturing · doi:10.1109/tsm.2017.2653062 · Cited by 22
K-means clustering algorithm based on improved Cuckoo search algorithm and its application
Ye, S., Huang, X., Teng, Y., & Li, Y. (2018) · IEEE International Conference on Big Data Analysis (ICBDA) · doi:10.1109/icbda.2018.8367720 · Cited by 16 · cited 1×
“The authors in [42] proposed an improvement to the vanilla k-means algorithm that prevents it from getting stuck to a local minima.”
Automatic Initialization Methods for Photonic Components on a Silicon-Based Optical Switch
Tondini, S., Castellan, C., Medina, M. A., & Pavesi, L. (2019) · Applied Sciences · doi:10.3390/app9091843 · Cited by 16 · cited 1×
“It is also studied in statistics, pattern recognition, computational geometry, bioinformatics, optimization, image processing, and in a variety of other fields [4–7].”
Potential- $K$- Means for Load Balancing and Cost Minimization in Mobile Recycling Network
Cabria, I., & Gondra, I. (2014) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2363156 · Cited by 14
Coordinate Rotation-Based Low Complexity $K$ -Means Clustering Architecture
Adapa, B., Biswas, D., Bhardwaj, S., Raghuraman, S., Acharyya, A., & Maharatna, K. (2017) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2016.2633543 · Cited by 13
An Ellipsoidal K-Means for Document Clustering
Dzogang, F., Marsala, C., Lesot, M., & Rifqi, M. (2012) · Proceedings · doi:10.1109/icdm.2012.126 · Cited by 11 · cited 1×
“In [65], an “ellipsoidal k-means” algorithm was proposed that extends the “spherical k-means” algorithm for selecting features in a sparse and high-dimensional dataset.”
An Extended Fuzzy k-Means Algorithm for Clustering Categorical Valued Data
Jiacai, W., & Ruijun, G. (2010) · doi:10.1109/aici.2010.225 · Cited by 7 · cited 1×
“[60] introduced an extended form of the fuzzy k-means (xFKM) algorithm for datasets with non-numerical attributes, such as categorical data.”
An Unsupervised Approach of Knowledge Discovery from Big Data in Social Network
Ahmed, M. (2017) · ICST Transactions on Scalable Information Systems · doi:10.4108/eai.25-9-2017.153148 · Cited by 7
Self-citationFully convolution neural network combined with K-means clustering algorithm for image segmentation
Wen, Y., He, B., Qiao, F., & Chen, W. (2018) · International Conference on Digital Image Processing · doi:10.1117/12.2502814 · Cited by 7 · cited 1×
“A more recent work in [37] used a fully connected deep convolution neural network along with k-means and performed pixel matching between a segmented image and a convoluted image.”
Non‐alternating stochastic K ‐means based on probabilistic representation of solution space
Lee, M. (2019) · Electronics Letters · doi:10.1049/el.2018.7531 · Cited by 3
Detecting Rare and Collective Anomalies in Network Traffic Data using Summarization
Ahmed, M. (2016) · UNSWorks (UNSW Sydney) · doi:10.26190/unsworks/3066 · Cited by 1
Self-citation
Research works printed but not linked: 1
- Mohri, M., Rostamizadeh, A., and Talwalkar, A. (2012). Foundations of Machine Learning, MIT Press.
Cited by
Ikotun, A. M., Ezugwu, A. E., Abualigah, L., Abuhaija, B., & Heming, J. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.139 · Cited by 2,272
Hussain, M. (2023) · Machines · doi:10.3390/machines11070677 · Cited by 1,217
“…automated hot-spot detection within PV cells based a modi fi ed version of the YOLO-v5 architecture. precision at varying scales, k-means clustering [48] is deployed for clustering the The fi rst improvement comes in the form of enhanced anchors and detection heads for the respective architecture.…”
MethodA Review on Autonomous Vehicles: Progress, Methods and Challenges
Parekh, D., Poddar, N., Rajpurkar, A., Chahal, M., Kumar, N., Joshi, G. P., & Cho, W. (2022) · Electronics · doi:10.3390/electronics11142162 · Cited by 517
“It associates every cluster with a centroid and aims to minimize the total sum of distances between cluster centroids and their data points iteratively [14].”
BackgroundK-Means and Alternative Clustering Methods in Modern Power Systems
Miraftabzadeh, S. M., Colombo, C. G., Longo, M., & Foiadelli, F. (2023) · IEEE Access · doi:10.1109/access.2023.3327640 · Cited by 245
“The K-means algorithm is a popular choice for clustering analysis in power systems due to its simplicity, efficiency, scalability, and ease of implementation [11], [12].”
BackgroundMethodInfluentialNetwork Abnormal Traffic Detection Model Based on Semi-Supervised Deep Reinforcement Learning
Dong, S., Xia, Y., & Peng, T. (2021) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2021.3120804 · Cited by 193
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)

