An efficient k-means clustering algorithm: analysis and implementation
The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Abstract
In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's (1982) algorithm. We present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm's running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
(1979) · Cited by 43,841
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
(1967) · Cited by 23,719
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836 · cited 1×
“(More accurately, it should be called the generalized Lloyd’s algorithm since Lloyd’s original result was for scalar data [37].)”
BackgroundJain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199 · cited 1×
“For further information on clustering and clustering algorithms, see [34], [11], [28], [30], [29].”
Background(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865 · cited 3×
“For further information on clustering and clustering algorithms, see [34], [11], [28], [30], [29].”
BackgroundMethod
Research works printed but not linked: 3
- Ball, Some Fundamental Concepts and Synthesis Procedures for Pattern Recognition Preprocessors
- Faber, 1994, Clustering and the Continuous $\big. k\hbox{-}{\rm{means}}\bigr.$ Algorithm, Los Alamos Science, 22, 138
- Forgey, 1965, Cluster Analysis of Multivariate Data: Efficiency vs. Interpretability of Classification, Biometrics, 21, 768,
Cited by
Items 601–700 of 1,008
ECG Language processing (ELP): A new technique to analyze ECG signals
Mousavi, S., Afghah, F., Khadem, F., & Acharya, U. R. (2021) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2021.105959 · Cited by 66
“This can be done by feeding all waves into off-the-shelf clustering algorithms such as K-means, spectral clustering or agglomerative clustering algorithms [15], [16], [17].”
BackgroundImplementing Machine Learning in Interventional Cardiology: The Benefits Are Worth the Trouble
Ali, W. B., Pesaranghader, A., Avram, R., Overtchouk, P., Perrin, N., Laffite, S., Cartier, R., Ibrahim, R., Modine, T., & Hussin, J. (2021) · Frontiers in Cardiovascular Medicine · doi:10.3389/fcvm.2021.711401 · Cited by 61
“K-Means Clustering is an unsupervised learning algorithm that groups the unlabeled dataset into different clusters (98).”
MethodAutomated rock mass discontinuity set characterisation using amplitude and phase decomposition
Singh, S. K., Banerjee, B. P., Lato, M. J., Sammut, C., & Raval, S. (2021) · International Journal of Rock Mechanics and Mining Sciences · doi:10.1016/j.ijrmms.2022.105072 · Cited by 57
Adaptive weighted multi-view evidential clustering with feature preference
Liu, Z., Huang, H., Letchmunan, S., & Deveci, M. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.111770 · Cited by 57
Publishing anonymous survey rating data
Sun, X., Wang, H., Li, J., & Pei, J. (2010) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0208-4 · Cited by 66
“This the proportion of data points changing cluster memberships from clusters on the original data set to clusters on the anonymized data set when a clustering algorithm [e.g., k-means algorithm ( Kanungo et al. 2002 )] runs on both data sets.”
BackgroundRana, S. S., Jasola, S., & Kumar, R. (2011) · International Journal of Engineering Science and Technology · doi:10.4314/ijest.v2i6.63708 · Cited by 57
“A filtering algorithm based on kd-tree increased the speed of clustering process (Kanungo et al., 2002).”
MethodTang, Y., Guo, Y., Sun, Q., Tang, S., Li, J., Guo, L., & Duan, J. (2018) · Optik · doi:10.1016/j.ijleo.2018.03.121 · Cited by 57
Vision-Based Monitoring of Flare Soot
Gu, K., Zhang, Y., & Qiao, J. (2020) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2020.2978921 · Cited by 60
Baghanam, A. H., Nourani, V., Aslani, H., & Taghipour, H. (2020) · Journal of Hydrology · doi:10.1016/j.jhydrol.2020.125581 · Cited by 57
Exploratory data analysis (EDA) machine learning approaches for ocean world analog mass spectrometry
Poian, V. D., Theiling, B., Clough, L. A., McKinney, B. A., Major, J., Chen, J., & Hörst, S. M. (2023) · Frontiers in Astronomy and Space Sciences · doi:10.3389/fspas.2023.1134141 · Cited by 60
“The KMeans algorithm (Kanungo et al., 2002) is a type of partitional clustering.”
MethodMa, S., Huang, Y., Liu, Y., Liu, H., Chen, Y., Wang, J., & Xu, J. (2023) · Applied Energy · doi:10.1016/j.apenergy.2023.121608 · Cited by 59
Fast FPGA-Based Multiobject Feature Extraction
Gu, Q., Takaki, T., & Ishii, I. (2012) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2202195 · Cited by 56
DETERMINISTIC INITIALIZATION OF THE K-MEANS ALGORITHM USING HIERARCHICAL CLUSTERING
CELEBI, M. E., & KINGRAVI, H. A. (2012) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001412500188 · Cited by 56
Scenario Reduction Applied to Geostatistical Simulations
Armstrong, M., Ndiaye, A., Razanatsimba, R., & Galli, A. (2012) · Mathematical Geosciences · doi:10.1007/s11004-012-9420-7 · Cited by 56
A novel video based system for detecting and counting vehicles at user-defined virtual loops
Barcellos, P., Bouvié, C., Escouto, F. L., & Scharcanski, J. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.09.045 · Cited by 65
iBump: Smartphone application to detect car accidents
Aloul, F., Zualkernan, I. A., Abu-Salma, R., Al-Ali, H., & Al-Merri, M. (2015) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2015.03.003 · Cited by 60
“The K-means algorithm is a well-known clustering algorithm [19].”
MethodGao, C., Liu, Y., Jin, J., Wei, T., Zhang, J., & Zhu, L. (2016) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2016.05.131 · Cited by 56
“(2) (Kaya, 1990): 194 2 Strictly speaking, STIRPAT is a statistical method rather than a decomposition method.”
MethodUnsupervised feature learning for autonomous rock image classification
Shu, L., McIsaac, K., Osinski, G. R., & Francis, R. (2017) · Computers & Geosciences · doi:10.1016/j.cageo.2017.05.010 · Cited by 56
Centroid Update Approach to K-Means Clustering
Borlea, I.-D., Precup, R., Drăgan, F., & Borlea, A.-B. (2017) · Advances in Electrical and Computer Engineering · doi:10.4316/aece.2017.04001 · Cited by 56
Gradient Regularized Contrastive Learning for Continual Domain Adaptation
Tang, S., Su, P., Chen, D., & Ouyang, W. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i3.16370 · Cited by 67
Effective Segmentation for Dental X-Ray Images Using Texture-Based Fuzzy Inference System
Lai, Y. H., & Lin, P. L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88458-3_85 · Cited by 55
“K-means [ 6 ] is a prototype-based clustering algorithm that attempts to cluster pixels into a user-specified number of clusters K according to extracted feature vectors.”
MethodK-Means Clustering with Bagging and MapReduce
Li, H., Wu, G., Hu, X., Zhang, J., Li, L., & Wu, X. (2011) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2011.265 · Cited by 55
“There are several variation algorithms of k-means: The EM algorithm maintains probabilistic assignments to clusters, instead of the deterministic assignments in k-means; K-means++ seeks to choose better starting clusters --a way to avoid the sometimes poor clusters found by the standard kmeans algorithm; the filtering…”
MethodTool orientation optimization for 5-axis machining with C-space method
Mi, Z., Yuan, C.-M., Ma, X., & Shen, L. (2016) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-016-8849-0 · Cited by 55
“A usual way of computing the boundary of the collision region is to check for each facet of the mesh whether a collision occurs based on brute-force algorithm see [17, 27, 28].”
BackgroundThayer, K. M., Lakhani, B., & Beveridge, D. L. (2017) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.7b02083 · Cited by 56
A waste city management system for smart cities applications
Vu, D. D., & Kaddoum, G. (2017) · Advances in Wireless and Optical Communications (RTUWO) · doi:10.1109/rtuwo.2017.8228538 · Cited by 55
“K-means [17] is an unsupervised machine learning algorithm that groups a dataset into a user-specified number (k) of clusters.”
MethodAutomatic Detection of Field-Grown Cucumbers for Robotic Harvesting
Fernández, R., Montes, H., Surdilovic, J., Surdilovic, D., de Santos, P. G., & Armada, M. (2018) · IEEE Access · doi:10.1109/access.2018.2851376 · Cited by 57
“the quantization of the feature space using K-means clustering [24], [25].”
MethodClassification and Clustering Algorithms of Machine Learning with their Applications
Ahuja, R., Chug, A., Gupta, S., Ahuja, P., & Kohli, S. (2019) · Studies in computational intelligence · doi:10.1007/978-3-030-28553-1_11 · Cited by 61
Huang, J., Liu, Z., Cai, W., Qian, Y., Berrocal, E., Aldén, M., & Li, Z. (2021) · Combustion and Flame · doi:10.1016/j.combustflame.2021.111430 · Cited by 55
Fast K-Means with Accurate BoundsPreprint
Newling, J., & Fleuret, F. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.02514 · Cited by 55
“Examples are the adaptation of the algorithm of Orchard (1991) in Phillips (2002), and the use of kdtrees Bentley (1975) in Kanungo et al. (2002).”
MethodZanbouri, K., & Navimipour, N. J. (2019) · International Journal of Communication Systems · doi:10.1002/dac.4259 · Cited by 54
“…d ‐ dimensional space Rd and a set of k points in Rd are supposed to minimize the mean squared distance from each data point to its nearest center .44 Distance is measured based on Euclidean distance using Equation (5) 45 as follows: where q c represents the value of the l th attribute for the j…”
MethodSalmanpour, M. R., Shamsaei, M., Hajianfar, G., Hamid Soltanian-zadeh, A., & Rahmim, A. (2021) · Quantitative Imaging in Medicine and Surgery · doi:10.21037/qims-21-425 · Cited by 54
Yang, M., Wang, D., Xu, C., Dai, B., Ma, M., & Su, X. (2023) · Renewable Energy · doi:10.1016/j.renene.2023.05.004 · Cited by 54
Scaling-robust fingerprint verification with smartphone camera in real-life scenarios
Ramachandra, R., Busch, C., & Yang, B. (2013) · IEEE International Conference on Biometrics: Theory, Applications and Systems (BTAS) · doi:10.1109/btas.2013.6712736 · Cited by 54
“Figure 6 illustrates the overall procedure of the proposed scaling scheme that is based on finding the local minima followed by a k-means clustering [9] that can be structured using the following steps:”
BackgroundK-means-based color palette design scheme with the use of stable flags
Hu, Y., & Lee, M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2762241 · Cited by 55
Attribute-based learning for gait recognition using spatio-temporal interest points
Kusakunniran, W. (2014) · Image and Vision Computing · doi:10.1016/j.imavis.2014.10.004 · Cited by 55
“In the histogram quanti215 zation step, the k−means clustering [47] is applied to all STIP descriptors from the training dataset.”
MethodA Simple and Fast Algorithm for Global K-means Clustering
Xie, J., & Jiang, S. (2010) · International Workshop on Education Technology and Computer Science · doi:10.1109/etcs.2010.347 · Cited by 54
“As the most well known technique for performing non-hierarchical clustering, the K-means clustering [ 4 ] iteratively finds the k centroids and assigns each sample to the nearest centroid, where the coordinate of each centroid is the mean of the coordinates of the objects in the cluster.”
MethodYu, B., Gao, J.-R., Ding, D., Zeng, X., & Pan, D. Z. (2014) · Journal of Micro/Nanopatterning Materials and Metrology · doi:10.1117/1.jmm.14.1.011003 · Cited by 54
“Once the pattern matching-based clustering is done, we further apply local clustering by k -means clustering 21 for each cluster obtained in the first stage.”
MethodAn efficient curvature‐based partitioning of large‐scale STL models
Hao, J., Fang, L., & Williams, R. E. (2011) · Rapid Prototyping Journal · doi:10.1108/13552541111113862 · Cited by 54
Robust Clustering as Ensembles of Affinity Relations
Liu, H., Latecki, L. J., & Yan, S. (2010) · National University of Singapore · Cited by 54
Depth-based human activity recognition: A comparative perspective study on feature extraction
Ali, H. H., Moftah, H. M., & Youssif, A. A. A. (2017) · Future Computing and Informatics Journal · doi:10.1016/j.fcij.2017.11.002 · Cited by 58
“K-means clustering [34] is implied on all vectors to decrease the high dimensionality.”
MethodLabel Distribution Learning by Exploiting Sample Correlations Locally
Zheng, X., Jia, X., & Li, W. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11693 · Cited by 54
“For easy implementation, we use k-means (Kanungo et al. 2002) as the clustering method.”
MethodDeActive: Scaling Activity Recognition with Active Deep Learning
Hossain, H. M. S., Al Haiz Khan, M. A., & Roy, N. (2018) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3214269 · Cited by 56
Ren, F., Dong, Y., & Wang, W. (2018) · Neural Computing and Applications · doi:10.1007/s00521-018-3664-1 · Cited by 57
Improving performance of classification on incomplete data using feature selection and clustering
Tran, C. T., Zhang, M., Andreae, P. M., Xue, B., & Bui, L. T. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.09.026 · Cited by 54
Approximating Spectral Clustering via Sampling: A Review
Tremblay, N., & Loukas, A. (2019) · Unsupervised and semi-supervised learning · doi:10.1007/978-3-030-29349-9_5 · Cited by 67
Zhao, J., Zhang, M., Yu, H., Ji, H., Song, G., Li, P., Wang, C., & Wu, J. (2019) · Applied Energy · doi:10.1016/j.apenergy.2019.03.118 · Cited by 60
Robust identification of Parkinson's disease subtypes using radiomics and hybrid machine learning
Salmanpour, M. R., Shamsaei, M., Saberi, A., Hajianfar, G., Soltanian-Zadeh, H., & Rahmim, A. (2020) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104142 · Cited by 54
A Systematic Overview of Android Malware Detection
Li, M., Fang, Z., Wang, J., Cheng, L., Zeng, Q., Yang, T., Wu, Y., & Jiaxuan, G. (2021) · Applied Artificial Intelligence · doi:10.1080/08839514.2021.2007327 · Cited by 58
“Given a set of N data points R d and an integer K in a real D-dimensional space, it is to find the center point in N data points, thus minimizing the mean square distance of each data point to its nearest center (Kanungo et al. 2002).”
BackgroundActive Semi-supervised Defect Categorization
Thung, F., Le, X.-B. D., & Lo, D. (2015) · IEEE International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2015.15 · Cited by 54
“, k clusters) so as to minimize the mean squared distance from each data point to its nearest center [16].”
BackgroundYu, L., Yang, E., Luo, C. L., & Ren, P. (2021) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-03580-4 · Cited by 53
“To further improve the performance of the ACMD, predefined anchors are clustered by K-means (Kanungo et al. 2002) as [14,15, 18,21, 31,17, 25,26, 20,38, 36,35, 30,78, 63,48, 93,118].”
MethodRSS gradient-assisted frontier exploration and radio source localization
Twigg, J. N., Fink, J. R., Yu, P. L., & Sadler, B. M. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6225059 · Cited by 53
“Frontier segments are identified by a k-means algorithm [10].”
BackgroundA novel ant-based clustering algorithm using the kernel method
Zhang, L., & Cao, Q. (2010) · Information Sciences · doi:10.1016/j.ins.2010.11.005 · Cited by 55
“Classic clustering approaches include partition-based methods, such as K-means, K-medoids, and K-prototypes [20,22]; hierarchy-based methods, such as BIRCH [44]; density-based methods [1,10]; grid-based methods [43]; and model-based methods, such as neural networks and self-organizing map (SOM) [4,30].”
MethodK-means clustering using Max-min distance measure
Visalakshi, N. K., & Suguna, J. (2009) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2009.5156398 · Cited by 53
Selim, A. J., Rogers, W. H., Qian, S. X., Rothendler, J. A., Kent, E. E., & Kazis, L. E. (2018) · Quality of Life Research · doi:10.1007/s11136-018-1850-3 · Cited by 53
Qiu, Y., Li, Q., Pan, Y., Yang, H. C., & Chen, W. (2018) · International Journal of Hydrogen Energy · doi:10.1016/j.ijhydene.2018.09.179 · Cited by 53
Visual Causality Analysis Made Practical
Wang, J., & Mueller, K. D. (2017) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2017.8585647 · Cited by 63
“Three data clusters have been recognized by kmeans clustering [38] and are colored blue, yellow and red, respectively (with interactive facilities shown in Fig.”
MethodYin, L., Ye, B., Zhang, Z., Tao, Y., Xu, H., Avila, J. R. S., & Yin, W. (2019) · NDT & E International · doi:10.1016/j.ndteint.2019.04.005 · Cited by 53
“K-means algorithm is one of the main clustering algorithms which attempts to group the data into clusters minimising the sum of squared Euclidian distances of each data points with respect to their nearest cluster centre [13].”
MethodFair Coresets and Streaming Algorithms for Fair k-Means ClusteringPreprint
Schmidt, M., Schwiegelshohn, C., & Sohler, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.10854 · Cited by 64
“In addition to the above cited coreset constructions, coresets for k-means in particular have also been studied empirically [1, 3, 25, 27, 33].”
BackgroundCheng, L., Karkhanis, P., Gökbağ, B., Liu, Y., & Li, L. (2022) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1008885 · Cited by 52
“For instance, the k-means clustering algorithm iteratively assigns data points (cells) (Kanungo et al ., 2002) to the nearest centroids (cluster center) and recomputes the centroids based on a predefined number of clusters, and Gaussian Mixture Models (GMMs) (Geoffrey et al ., 1998) tend to group…”
MethodRekha, & Garg, R. (2024) · Cluster Computing · doi:10.1007/s10586-024-04280-2 · Cited by 52
Korfiatis, N., & Poulos, M. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.03.046 · Cited by 57
Development of high spatial resolution rainfall data for Ghana
Aryee, J. N. A., Amekudzi, L. K., Quansah, E., Klutse, N. A. B., Atiah, W. A., & Yorke, C. (2017) · International Journal of Climatology · doi:10.1002/joc.5238 · Cited by 52
“Thereafter, they were clustered using the k-means cluster (precisely, Lloyd’s algorithm), described in Kanungo et al. (2002), which is based on the simple observation that optimal placements of a data centre is at the centroid of the associated cluster.”
MethodClustering With Orthogonal AutoEncoder
Wang, W., Yang, D., Chen, F., Pang, Y., Huang, S., & Ge, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2916030 · Cited by 49
Two-Level Attention Model of Representation Learning for Fraud Detection
Cao, R., Liu, G., Xie, Y., & Jiang, C. (2021) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2021.3074175 · Cited by 55
Yang, G., Zhao, C., Liu, Q., Huang, W., & Wang, J. (2010) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2010.2071416 · Cited by 52
“ular algorithms for clustering analysis [33].”
Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes
Liu, T., Tao, D., & Xu, D. (2016) · Neural Computation · doi:10.1162/neco_a_00872 · Cited by 55
“Asymptotic and non-asymptotic consistency performances h ave been considered by Pollard (1982), Chou (1994), Linder et al.”
BackgroundAccelerated EM-based clustering of large data sets
Verbeek, J. J., Nunnink, J. R. J., & Vlassis, N. A. (2006) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0033-3 · Cited by 51
“Several authors (Omohundro, 1989; Moore, 1999; Moore and Pelleg, 1999; Kanungo et al., 2002) have proposed speedups of these algorithms in which the data are flrst grouped and statistics of these groups are cached, and then learning iterates only through these statistics instead of the data…”
BackgroundMethodInfluentialBoucenna, S., Gaussier, P., Andry, P., & Hafemeister, L. (2014) · International Journal of Social Robotics · doi:10.1007/s12369-014-0245-z · Cited by 54
“The extracted local view around each focus point is learned and categorized by a group of neurons V F (visual features) using a k-means variant that allows online learning and real-time functions [27] called SAW (Self Adaptive Winner takes all):”
MethodScalable Learning of Collective Behavior
Tang, L., Wang, X., & Liu, H. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.38 · Cited by 54
Cardiac flow component analysis
Wong, K. K. L., Tu, J. Y., Kelso, R. M., Worthley, S. G., Sanders, P., Mazumdar, J., & Abbott, D. (2009) · Medical Engineering & Physics · doi:10.1016/j.medengphy.2009.11.007 · Cited by 52
Kabade, R. S., & Gaikwad, M. S. (2013) · Cited by 51
Reliability-based controller placement algorithm in software defined networking
Liu, J., Liu, J., & Xie, R. (2016) · Computer Science and Information Systems · doi:10.2298/csis160225014l · Cited by 51
“To solve the optimal controller placement problem formulated in the above section, we can view the optimization problem in (2) as clustering analysis problem, and use the typical clustering algorithm named K-means algorithm [11,22] to find the global optimal solution.”
MethodSehgal, V., Lakhanpal, A., Rathinasamy, M., Khosa, R., & Sridhar, V. (2016) · Journal of Hydrology · doi:10.1016/j.jhydrol.2016.10.048 · Cited by 53
Mobile social networks: Design requirements, architecture, and state-of-the-art technology
Mao, Z., Jiang, Y., Min, G., Leng, S., Jin, X., & Yang, K. (2016) · Computer Communications · doi:10.1016/j.comcom.2016.11.006 · Cited by 51
Building a taxonomy of eco-innovation types in firms. A quantitative perspective
Kiefer, C. P., Carrillo‐Hermosilla, J., & RÍO, P. D. (2019) · Resources Conservation and Recycling · doi:10.1016/j.resconrec.2019.02.021 · Cited by 56
Fernández, A., Usamentiaga, R., de Arquer, P., Fernández, M. Á., Fernández, D., Candás, J. L. C., & Fernández, M. (2020) · Applied Sciences · doi:10.3390/app10175948 · Cited by 51
“For the detection of the panels surface, the K-means clustering algorithm [26] is applied.”
MethodMeng, D., Xu, J., & Zhao, J. (2021) · PLoS ONE · doi:10.1371/journal.pone.0261629 · Cited by 52
“We utilized the K-means algorithm to cluster 31 provinces in mainland China [31].”
MethodOptimising -means clustering results with standard software packages
Hand, D. J., & Krzanowski, W. J. (2004) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.06.017 · Cited by 51
Improvement of the k-means clustering filtering algorithm
Lai, J. Z. C., & Liaw, Y. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.06.005 · Cited by 59
“[10] to speed up the clustering process.”
BackgroundMethodInfluentialA reductive approach to hypergraph clustering: An application to image segmentation
Ducournau, A., Bretto, A., Rital, S., & Laget, B. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2012.01.005 · Cited by 50
Stress detection and reduction using EEG signals
Kalas, M. S., & Momin, B. F. (2016) · International Conference on Electrical, Electronics, and Optimization Techniques · doi:10.1109/iceeot.2016.7755604 · Cited by 50
Evaluating the impact of renewable generation on transmission expansion planning
Mortaz, E., & Valenzuela, J. F. (2018) · Electric Power Systems Research · doi:10.1016/j.epsr.2018.12.007 · Cited by 52
Deer Crossing Road Detection With Roadside LiDAR Sensor
Chen, J., Xu, H., Wu, J., Yue, R., Yuan, C., & Wang, L. (2019) · IEEE Access · doi:10.1109/access.2019.2916718 · Cited by 53
“There are many different algorithms available for object clustering, including k-means clustering, fuzzy clustering, and density-based clustering [29]–[31].”
MethodFast Approximate $$K$$-Means via Cluster Closures
Wang, J., Wang, J., Ke, Q., Zeng, G., & Li, S. (2015) · Springer eBooks · doi:10.1007/978-3-319-14998-1_17 · Cited by 53
“The approach in [9] presents a filtering algorithm.”
MethodZhu, C., Zhang, J., Guan, R., Hale, L. E., Chen, N., Li, M., Lu, Z., Ge, Q., Yang, Y., Zhou, J. Z., et al. (2019) · The Science of The Total Environment · doi:10.1016/j.scitotenv.2019.06.150 · Cited by 50
Observation of Electron Shakeup in CdSe/CdS Core/Shell Nanoplatelets
Antolinez, F. V., Rabouw, F. T., Rossinelli, A. A., Cui, J., & Norris, D. J. (2019) · Nano Letters · doi:10.1021/acs.nanolett.9b02856 · Cited by 50
Oskooei, A., Chau, S., Weiß, J., Sridhar, A., Martínez, M. R., & Michel, B. (2020) · Studies in computational intelligence · doi:10.1007/978-3-030-53352-6_9 · Cited by 54
Zacchini, L., Franchi, M., & Ridolfi, A. (2022) · Journal of Field Robotics · doi:10.1002/rob.22061 · Cited by 51
“For further information on the k‐means algorithm, please refer to Bishop (2006) and (Kanungo et al., 2002).”
MethodBi, X., Lee, S., Ranville, J. F., Sattigeri, P., Spanias, A., Herckès, P., & Westerhoff, P. K. (2014) · Journal of Analytical Atomic Spectrometry · doi:10.1039/c4ja00109e · Cited by 50
A new data clustering approach for data mining in large databases
Tsai, C.-F., Wu, H., & Tsai, C.-W. (2003) · International Symposium on Pervasive Systems, Algorithms and Networks (ISPAN) · doi:10.1109/ispan.2002.1004300 · Cited by 50
Ranjbar, I., & Toufigh, V. (2022) · Cement and Concrete Research · doi:10.1016/j.cemconres.2022.107003 · Cited by 50
Lagrangian analysis by clustering
Koszalka, I. M., & LaCasce, J. H. (2010) · Ocean Dynamics · doi:10.1007/s10236-010-0306-2 · Cited by 49
“Such algorithms are used in diverse fields, such as data mining, image processing, and bioinformatics (Lloyd 1982; Kanungo et al. 2002; MacKay 2003).”
MethodA fast partitioning algorithm and its application to earthquake investigation
Scitovski, R., & Scitovski, S. (2013) · Computers & Geosciences · doi:10.1016/j.cageo.2013.06.010 · Cited by 53
A hybrid approach to speed-up the k-means clustering method
Sarma, T. H., Pulabaigari, V., & Reddy, B. E. (2012) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-012-0079-7 · Cited by 52
“The filtering approach [26] shows good performance over the data-sets with low dimensionality.”
MethodInfluentialTan, K., Zhang, Y., & Tong, X. (2016) · Remote Sensing · doi:10.3390/rs8110963 · Cited by 49
“Figure 17 shows the results of the comparison of the proposed cloud detection algorithm to three popular automatic image segmentation methods: k-means [33], meanshift [34], and Graph-based [35].”
MethodGuo, L., & Abbosh, A. M. (2018) · Bioelectromagnetics · doi:10.1002/bem.22118 · Cited by 49
“One of the simplest algorithms used to solve this problem is Lloyd’s algorithm [Lloyd, 1982] and in this paper, an improved K-means method [Kanungo et al., 2002] is used to categorize the CX profile.”
MethodMachine Learning-Based Analysis of Program Binaries: A Comprehensive Study
Xue, H., Sun, S., Venkataramani, G., & Lan, T. (2019) · IEEE Access · doi:10.1109/access.2019.2917668 · Cited by 61
“[6], filtering algorithm [71], etc.”
Review and Perspectives of Machine Learning Methods for Wind Turbine Fault Diagnosis
Tang, M., Zhao, Q., Wu, H., Wang, Z., Meng, C., & Wang, Y. (2021) · Frontiers in Energy Research · doi:10.3389/fenrg.2021.751066 · Cited by 50
“K-Means K-means clustering (Kanungo et al., 2002; Jain, 2010) is a simple unsupervised learning method which aims to divide n observations into K clusters, in which the observation belongs to the cluster with the nearest mean.”
MethodPixnostics: Towards Measuring the Value of Visualization
Schneidewind, J., Sips, M., & Keim, D. A. (2006) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2006.261423 · Cited by 49
“In the Pixnostics prototype we employed the k-means approach [21], one of the most popular approaches, since it is easy to implement and provides good results.”
MethodStructure-Guided Statistical Textural Distinctiveness for Salient Region Detection in Natural Images
Scharfenberger, C., Wong, A. M., & Clausi, D. A. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2380351 · Cited by 48
Metadata
- Authors
- Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-07
- Volume
- 24
- Issue
- 7
- Pages
- 881-892
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2161160262
- Cited by
- 5,660
- References
- 60
- Citations by year
- 2026: 127 · 2025: 206 · 2024: 270 · 2023: 290 · 2022: 349 · 2021: 415 · 2020: 405 · 2019: 443 · 2018: 429 · 2017: 375 · 2016: 327 · 2015: 303 · 2014: 294 · 2013: 272 · 2012: 273
- FWCI
- 30.44
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
- Funders
- National Science Foundation
- U.S. Department of Defense
- Army Research Laboratory
- 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, Lloyd's algorithm, filtering algorithms, k-d tree, cluster separation, color quantization, data compression, image segmentation
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.