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 501–600 of 1,008
HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering
Gribel, D., & Vidal, T. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.12.022 · Cited by 67
“Various studies have proposed more efficient data structures and speed-up techniques for this method [16, 25].”
Kalloo, G., Wellenius, G. A., McCandless, L. C., Calafat, A. M., Sjödin, A., Karagas, M. R., Chen, A., Yolton, K. A., Lanphear, B. P., & Braun, J. M. (2018) · Environmental Science & Technology · doi:10.1021/acs.est.8b02946 · Cited by 72
Multimodal Emotion Recognition Based on Ensemble Convolutional Neural Network
Huang, H., Hu, Z., Wang, W., & Wu, M. (2020) · IEEE Access · doi:10.1109/access.2019.2962085 · Cited by 66
“In order to obtain accurate emotional labels, we adopt a simple and fast algorithm k-means [23] to cluster arousal and valence degree on DEAP dataset.”
MethodHan, Y., & Moutarde, F. (2014) · International Journal of Intelligent Transportation Systems Research · doi:10.1007/s13177-014-0099-7 · Cited by 66
“K-means clustering [31] is then performed on the derived representation to unveil typical temporal evolution of the spatial congestion patterns.”
Residential Power Forecasting Using Load Identification and Graph Spectral Clustering
Dinesh, C., Makonin, S., & Bajić, I. V. (2019) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2019.2891704 · Cited by 66
“The rows of Y are then clustered using K-means clustering [31].”
MethodUnsupervised Anomaly Detection Using K-Means, Local Outlier Factor and One Class SVM
Budiarto, E. H., Permanasari, A. E., & Fauziati, S. (2019) · International Conference on Science and Technology (ICST) · doi:10.1109/icst47872.2019.9166366 · Cited by 66
“K-Means is a clustering algorithm that can group data by comparing its mean value [12].”
MethodMachine learning for molecular thermodynamics
Ding, J., Xu, N., Nguyen, M. T., Qiao, Q., Shi, Y., He, Y., & Shao, Q. (2021) · Chinese Journal of Chemical Engineering · doi:10.1016/j.cjche.2020.10.044 · Cited by 68
Making recommender systems forget: Learning and unlearning for erasable recommendation
Li, Y., Chen, C., Zheng, X., Liu, J., & Wang, J. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.111124 · Cited by 84
Foster, B. H., Bağcı, U., Xu, Z., Dey, B., Luna, B. M., Bishai, W. R., Jain, S. K., & Mollura, D. J. (2014) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2013.2288258 · Cited by 66
“clustering-based methods such as fuzzy c-means [20], k-means [21], etc.”
MethodThe multi-depot split-delivery vehicle routing problem: Model and solution algorithm
Ray, S., Soeanu, A., Berger, J., & Debbabi, M. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.08.006 · Cited by 66
“Many algorithms addressing network partitioning exist in the literature, such as: K-Means clustering [16], DB-Scan algorithm, shortest path algorithm [17] etc.”
MethodAnalysis of Car Crash Simulation Data with Nonlinear Machine Learning Methods
Bohn, B., Garcke, J., Iza-Teran, R., Paprotny, A., Peherstorfer, B., Schepsmeier, U., & Thole, C.-A. (2013) · Procedia Computer Science · doi:10.1016/j.procs.2013.05.226 · Cited by 66
“On these clusters, dimensionality reduction methods are applied to show the underlying characteristics of the data.”
MethodCross-Language Clone Detection by Learning Over Abstract Syntax Trees
Pérez, D., & Chiba, S. (2019) · International Conference on Mining Software Repositories (MSR) · doi:10.1109/msr.2019.00078 · Cited by 87
“In Figure 5, we show a subset of some points plotted in 2D and clustered using k-means [24].”
MethodBoroujeni, A. M., Yousefi, E., & Somma, J. (2017) · Cancer Cytopathology · doi:10.1002/cncy.21915 · Cited by 68
“30 Based on Euclidean distance from the final centroids, similar clusters of pixels (ie, ROI) are identified (Fig.”
BackgroundNon-linear classifiers applied to EEG analysis for epilepsy seizure detection
del Rincón, J. M., Santofimia, M. J., García, X., Barba, J., Romero, F., Navas, P., & López, J. C. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.05.052 · Cited by 71
“The first clustering approach used in this work is k-means clustering Kanungo et al. (2002). In this algorithm, initial seeds for each of the K clusters are initialized to a random sample in the dataset.”
MethodZhang, W., Wei, S., Teng, Y., Zhang, J., Wang, X., & Yan, Z. (2017) · Sensors · doi:10.3390/s17122742 · Cited by 71
“Therefore, using the K-means clustering algorithm [30], the set of static obstacle points in ROGM can be partitioned with several smaller static stumbling blocks.”
MethodApplication of Landsat Data for Urban Growth Monitoring in Jeddah
Almazroui, M., Mashat, A. S., Assiri, M. E., & Butt, M. J. (2017) · Earth Systems and Environment · doi:10.1007/s41748-017-0028-4 · Cited by 68
“To extract information about different features from satellite data, various unsupervised classification methods (for example, K-mean and the ISODATA clustering algorithm) have been commonly used in the literature (Kanungo et al. 2002).”
MethodClustering of Driving Encounter Scenarios Using Connected Vehicle Trajectories
Wang, W., Ramesh, A., Zhu, J., Li, J., & Zhao, D. (2020) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2020.2973550 · Cited by 65
“In this paper, we prefer the k-means clustering (k-MC) [41] for simplicity and scalability.”
Artificial Intelligence for Wireless Caching: Schemes, Performance, and Challenges
Sheraz, M., Ahmed, M., Hou, X., Li, Y., Jin, D., Han, Z., & Jiang, T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3008362 · Cited by 68
Moini, R., Baghaie, A., Rodriguez, F. B., Zavattieri, P. D., Youngblood, J. P., & Olek, J. (2021) · Cement and Concrete Research · doi:10.1016/j.cemconres.2021.106493 · Cited by 64
Identifying Prototypical Components in Behaviour Using Clustering Algorithms
Braun, E., Geurten, B., & Egelhaaf, M. (2010) · PLoS ONE · doi:10.1371/journal.pone.0009361 · Cited by 60
“[32] to our high dimensional behavioural feature data.”
BackgroundScalable K-Means by ranked retrieval
Broder, A., Garcia-Pueyo, L., Josifovski, V., Vassilvitskii, S., & Venkatesan, S. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556260 · Cited by 72
“Previous work, [14, 20] used the fact that both points and clusters lie in a metric space to reduce the number of such computations.”
BackgroundChen, Z., & Wang, L. (2014) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2014.2361756 · Cited by 64
An efficient k-means clustering algorithm using simple partitioning
Hung, M.-C., Wu, J., Chang, J.-H., & Yang, D. (2005) · doi:10.6688/jise.2005.21.6.4 · Cited by 64
Umapathy, S., Anburajan, M., Sowmiya, V., Venkatraman, B., & Menaka, M. (2015) · Proceedings of the Institution of Mechanical Engineers Part H Journal of Engineering in Medicine · doi:10.1177/0954411915580809 · Cited by 68
Chen, C. R., Miga, M. I., & Galloway, R. L. (2008) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2008.2010383 · Cited by 64
Boratto, L., Carta, S., & Fenu, G. (2015) · Future Generation Computer Systems · doi:10.1016/j.future.2015.10.007 · Cited by 64
Genetic k-means algorithm based RBF network for photovoltaic MPP prediction
Liao, C.-C. (2009) · Energy · doi:10.1016/j.energy.2009.10.021 · Cited by 67
Chang, J.-Y., & Ju, P.-H. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2013.09.012 · Cited by 67
“Wemodify the k-means algorithm tomake an ideal cluster distribution for the sensor nodes according to the location information and residual energy for all of the sensor nodes [22–25].”
MethodAn effective and efficient hierarchicalK-means clustering algorithm
Qi, J., Yu, Y., Wang, L., Liu, J., & Wang, Y. (2017) · International Journal of Distributed Sensor Networks · doi:10.1177/1550147717728627 · Cited by 63
“Kanungo et al. 28 implement an efficient k -means method that first uses kd -tree to store instances and then adopts the index to prune or filter the candidate seeds to accelerate the procedure.”
MethodK-Medoids Clustering of Data Sequences With Composite Distributions
Wang, T., Li, Q., Bucci, D. J., Liang, Y., Chen, B., & Varshney, P. K. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2901370 · Cited by 63
“, k-means clustering [9]–[11] and k-medoids clustering [12]–[14], or connectivitybased clustering algorithms, e.”
BackgroundQuantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 73
Chen, D., Yang, H., Yang, L., Tang, Y., Zeng, H., He, J., Chen, W., Qu, Y., Hu, Y., Xu, Y., et al. (2023) · British Journal of Anaesthesia · doi:10.1016/j.bja.2023.10.015 · Cited by 69
Presekal, A., Stefanov, A. I., Semertzis, I., & Pálenský, P. (2024) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2024.3474039 · Cited by 77
Long-bone fracture detection in digital X-ray images based on digital-geometric techniques
Bandyopadhyay, O., Biswas, A., & Bhattacharya, B. B. (2015) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2015.09.013 · Cited by 63
“Another widely used segmentation method is k-means clustering [15,16] that segments the region of interest (ROI) more efficiently than classical segmentation approaches such as ‘Canny’ or ‘OTSU’.”
MethodInfluentialRobust Capped Norm Nonnegative Matrix Factorization
Gao, H., Nie, F., Cai, W., & Huang, H. (2015) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2806416.2806568 · Cited by 63
“[3] improved the NMF algorithm by adding an orthogonal constraint, proving the equivalence between orthogonal NMF and the relaxed KMeans clustering [13], and also extending it to Nonnegative Matrix Tri-Factorization (NMTF) for co-clustering.”
MethodClassifying web search queries to identify high revenue generating customers
Ortiz‐Cordova, A., & Jansen, B. J. J. (2012) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.22640 · Cited by 79
“Based on the attributes, we employed a k-means clustering algorithm (Kanungo et al., 2002) to segment clusters of customers based on referral keywords and the onsite behaviors associated with those keywords.”
MethodData-Driven Design of Intelligent Wireless Networks: An Overview and Tutorial
Kulin, M., Fortuna, C., Poorter, E. D., Deschrijver, D., & Moerman, I. (2016) · Sensors · doi:10.3390/s16060790 · Cited by 69
“In the context of wireless networks, unsupervised learning algorithms are widely used for: data aggregation [31], node clustering for WSNs [31,71–73], data clustering [74–76], event detection [77] and several cognitive radio applications [78,79].”
MethodSowing date detection at the field scale using CubeSats remote sensing
Sadeh, Y., Zhu, X., Chenu, K., & Dunkerley, D. L. (2019) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2019.01.042 · Cited by 66
Papaioannou, V. E., Chouvarda, I. G., Maglaveras, N. K., & Pneumatikos, I. A. (2012) · Critical Care · doi:10.1186/cc11255 · Cited by 61
Pattnaik, P., Sharma, A., Choudhary, M., Singh, V., Agarwal, P. K., & Kukshal, V. (2020) · Materials Today Proceedings · doi:10.1016/j.matpr.2020.11.026 · Cited by 73
A Novel Defect Detection Algorithm for Flexible Integrated Circuit Package Substrates
Zhong, Z., & Ma, Z. (2021) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2021.3057026 · Cited by 62
“Through the comparisons with six widely used methods [32]– [37], the effectiveness of the proposed algorithm was verified.”
MethodHighly specialized recreationists contribute the most to the citizen science project eBird
Rosenblatt, C. J., Dayer, A. A., Duberstein, J. N., Phillips, T., Harshaw, H. W., Fulton, D. C., Cole, N. W., Raedeke, A. H., Rutter, J. D., & Wood, C. (2022) · Ornithological Applications · doi:10.1093/ornithapp/duac008 · Cited by 62
Bayesian Deep Learning for Aircraft Hard Landing Safety Assessment
Kong, Y., Zhang, X., & Mahadevan, S. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3162566 · Cited by 63
“Several types of clustering algorithms are available, such as prototype-based clustering [41], [42], density-based clustering [43] and hierarchical clustering [44].”
MethodBashore, F. M., Foley, C. A., Ong, H. W., Rectenwald, J. M., Hanley, R. P., Norris-Drouin, J. L., Cholensky, S. H., Mills, C. A., Pearce, K. H., Herring, L. E., et al. (2023) · ACS Chemical Biology · doi:10.1021/acschembio.2c00804 · Cited by 63
Urban Area Characterization Based on Semantics of Crowd Activities in Twitter
Wakamiya, S., Lee, R., & Sumiya, K. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20630-6_7 · Cited by 63
“Specifically, we adopted the K-means clustering method [5] based on the geographical occurrences of a dataset.”
BackgroundMethodInfluentialScene Learning for Cloud Detection on Remote-Sensing Images
An, Z., & Shi, Z. (2015) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2015.2438015 · Cited by 62
“K-means, Chan– Vese, and method of [1] tend to obtain more false alarms, while Mean-shift tends to miss some clouds.”
MethodInfluentialPark, J. E., Kim, H. S., Goh, M. J., Kim, S. J., & Kim, J. H. (2015) · Radiology · doi:10.1148/radiol.14141414 · Cited by 62
Fall Detection Based on Sequential Modeling of Radar Signal Time-Frequency Features
Wu, M., Dai, X., Zhang, Y. D., Davidson, B. S., Amin, M. G., & Zhang, J. (2013) · IEEE International Conference on Healthcare Informatics (ICHI) · doi:10.1109/ichi.2013.27 · Cited by 62
“We use the k-means clustering [14] to convert a feature vector sequence into a symbol sequence for HMMs.”
MethodA skinning approach for dynamic 3D mesh compression
Mamou, K., Zaharia, T. B., & Preteux, F. J. (2006) · Computer Animation and Virtual Worlds · doi:10.1002/cav.137 · Cited by 62
“The partition π is then obtained by applying the k-means clustering algorithm [16] to the vector set (α)v∈{1,.”
MethodFast global k-means clustering using cluster membership and inequality
Lai, J. Z. C., & Huang, T.-J. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2009.11.021 · Cited by 62
Novel Item Recommendation by User Profile Partitioning
Zhang, M., & Hurley, N. (2009) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iat.2009.85 · Cited by 62
“3) K-means: Since each item in the user profile is represented as a M -dimensional vector of user ratings, where M is the total number of system users, it is evident that (7) is somewhat similar to the objective of the k-means [6] algorithm.”
MethodSimplifying Mixture Models Through Function Approximation
Zhang, K., & Kwok, J. T.-Y. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2040835 · Cited by 62
“Unnecessary component summations in the model evaluation can then be circumvented by performing a neighborhood search through spatial data structures, such as the kd-trees 1045-9227/$26.00 © 2010 IEEE [25], [31].”
MethodInfluentialSteel-surface defect detection using a switching-lighting scheme
Jeon, Y.-J., Choi, D.-C., Lee, S. J., Yun, J. P., & Kim, S. W. (2016) · Applied Optics · doi:10.1364/ao.55.000047 · Cited by 61
Transferable Adaptive Differential Evolution for Many-Task Optimization
Wu, S.-H., Zhan, Z., Tan, K. C., & Zhang, J. (2023) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2023.3234969 · Cited by 64
Spatial–Spectral Graph Contrastive Clustering With Hard Sample Mining for Hyperspectral Images
Guan, R., Tu, W., Li, Z., Yu, H., Hu, D., Chen, Y., Tang, C., Yuan, Q., & Liu, X. (2024) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2024.3464648 · Cited by 93
The $L_{0}$ Regularized Mumford–Shah Model for Bias Correction and Segmentation of Medical Images
Duan, Y., Chang, H., Huang, W., Zhou, J., Lu, Z., & Wu, C. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2451957 · Cited by 61
“In order to compute the thresholds automatically, we use the k-means method [32] as an example for the discussion.”
MethodDu, Q., Gunzburger, M., Ju, L., & Wang, X. (2006) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-005-3620-4 · Cited by 61
“It is transparent that a suitable data structure that takes into account such stored information could lead to a much more efficient implementation [21].”
BackgroundAbdulaziz, A. M., Mahdi, H. A., & Sayyouh, M. H. (2018) · Journal of Applied Geophysics · doi:10.1016/j.jappgeo.2018.09.013 · Cited by 61
Innangi, S., Tonielli, R., Romagnoli, C., Budillon, F., Martino, G. D., Innangi, M., Laterza, R., Bas, T. L., & Iacono, C. L. (2018) · Marine Geophysical Research · doi:10.1007/s11001-018-9371-6 · Cited by 61
Examining municipal guidelines for users of shared E-Scooters in the United States
Ma, Q., Yang, H. J., Ma, Y., Yang, D., Hu, X., & Xie, K. (2021) · Transportation Research Part D Transport and Environment · doi:10.1016/j.trd.2021.102710 · Cited by 61
Bansal, R., Hao, X., Liu, F., Xu, D., Liu, J., & Peterson, B. S. (2013) · Magnetic Resonance Imaging · doi:10.1016/j.mri.2013.07.017 · Cited by 63
“We estimated the empirical distributions of each class of brain tissue by forming the histogram for the entire image and then using a K-means clustering algorithm to estimate optimal values for the means and variances of each tissue type [23,24].”
Deterministic Initialization of the K-Means Algorithm Using Hierarchical ClusteringPreprint
Celebi, M. E., & Kingravi, H. A. (2012) · Cited by 61
Effective Query Grouping Strategy in Clouds
Liu, Q., Guo, Y., Wu, J., & Wang, G. (2017) · Journal of Computer Science and Technology · doi:10.1007/s11390-017-1797-9 · Cited by 60
“Heuristic grouping is based on the classical heuristic clustering algorithm, k-means([9]).”
MethodA Density-Based Offloading Strategy for IoT Devices in Edge Computing Systems
Zhang, C., Zhao, H., & Deng, S. (2018) · IEEE Access · doi:10.1109/access.2018.2882452 · Cited by 60
Automatic Vehicle Detection With Roadside LiDAR Data Under Rainy and Snowy Conditions
Wu, J., Xu, H., Zheng, J., & Zhao, J. (2020) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2019.2926362 · Cited by 60
“K-means clustering cannot meet the real-time vehicle identification task, because the number of vehicles varies at different time and different sites [22].”
BackgroundKang, Z., You, C., & Zhang, R. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3043776 · Cited by 60
Lee, D. H., Park, J. E., Kim, N., Park, S. Y., Kim, Y., Cho, Y. H., & Kim, H. S. (2021) · European Radiology · doi:10.1007/s00330-021-08204-1 · Cited by 60
Machine-Learning-Based Traffic Classification in Software-Defined Networks
Serag, R. H., Abdalzaher, M. S., Elsayed, H. A. E. A., Sobh, M., Krichen, M., & Salim, M. M. (2024) · Electronics · doi:10.3390/electronics13061108 · Cited by 74
“K-means finds applications in diverse fields like customer segmentation, image segmentation, and anomaly detection [84].”
MethodMachine learning-assisted nanosensor arrays: An efficiently high-throughput food detection analysis
Li, Y., Zhang, W., Cui, Z., Shi, L., Shang, Y., Ji, Y., & Wang, J. (2024) · Trends in Food Science & Technology · doi:10.1016/j.tifs.2024.104564 · Cited by 60
Constraint-Aware Role Mining Via Extended Boolean Matrix Decomposition
Lu, H., Vaidya, J. S., Atluri, V., & Hong, Y. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2012.21 · Cited by 60
FPGA-based K-means clustering using tree-based data structures
Winterstein, F., Bayliss, S., & Constantinides, G. A. (2013) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2013.6645501 · Cited by 60
“This leads to the well-known binary kd-tree structure whose root node represents the bounding box of all data points and whose children Algorithm 1 The filtering algorithm introduced in [7].”
BackgroundInfluentialEstimating the number of clusters in a numerical data set via quantization error modeling
Kolesnikov, A., Trichina, E., & Kauranne, T. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.09.017 · Cited by 60
A dynamic shuffled differential evolution algorithm for data clustering
Xiang, W., Zhu, N. Y., Ma, S., Meng, X., & An, M.-Q. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.01.058 · Cited by 60
“These approaches mainly focus on complex network approach [1,27,29], K-means [4] and its enhanced variants [5,12,35,43], swarm intelligent algorithms [2,3,7,9,11,15-25,28,31,32,35-37,44], and others [8,10,13,14,26,30,33,34].”
BackgroundFiberScout: An Interactive Tool for Exploring and Analyzing Fiber Reinforced Polymers
Weissenböck, J., Amirkhanov, A., Li, W., Reh, A., Amirkhanov, A., Groller, E. M., Kastner, J., & Heinzl, C. (2014) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2014.52 · Cited by 60
“The result of a k-means [13] algorithm turned out to generate robust consequences for initial automatic classifications.”
MethodSupply chain quality management: an empirical study
Zhong, J., Ma, Y., Tu, Y., & Li, X. (2016) · International Journal of Contemporary Hospitality Management · doi:10.1108/ijchm-03-2015-0110 · Cited by 60
de Ferri, L., Tripodi, R., Martignon, A., Ferrari, E. S., Lagrutta-Diaz, A. C., Vallotto, D., & Pojana, G. (2018) · Spectrochimica Acta Part A Molecular and Biomolecular Spectroscopy · doi:10.1016/j.saa.2018.06.026 · Cited by 60
You Are How You Drive: Peer and Temporal-Aware Representation Learning for Driving Behavior Analysis
Wang, P., Fu, Y., Zhang, J., Wang, P., Zheng, Y., & Aggarwal, C. C. (2018) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3219819.3219985 · Cited by 73
“For (ii), we generate driving state vectors (introduced in Section 6.3) for each driver; we then apply K-Means [14] to cluster drivers into four groups based on their driving vectors.”
MethodInfluentialSentiment analysis using convolutional neural network via word embeddings
Nedjah, N., Santos, I., & Mourelle, L. D. M. (2019) · Evolutionary Intelligence · doi:10.1007/s12065-019-00227-4 · Cited by 65
A High-Precision Positioning Approach for Catenary Support Components With Multiscale Difference
Liu, Z., Liu, K., Zhong, J., Han, Z., & Zhang, W. (2019) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2019.2905905 · Cited by 60
“Traditional unsupervised clustering algorithms such as K-means [15] and density-based spatial clustering of applications with noise [16] are hard to be applied because of the unknown number of image classes and the difficulty to describe the distances between catenary images.”
BackgroundMultiplicity and clustering in Taurus star forming region: II. From ultra-wide pairs to dense NESTs
Joncour, I., Duchêne, G., Moraux, E., & Motte, F. (2018) · Astronomy and Astrophysics · doi:10.1051/0004-6361/201833042 · Cited by 69
Imran, I., Qayyum, F., Kim, D., Bong, S.-J., Chi, S., & Choi, Y. (2022) · Materials · doi:10.3390/ma15041428 · Cited by 67
“The clustering models involve Gaussian mixture modeling, spectral and K-means clustering, whereas principal component analysis and independent component analysis systems fall under dimensionality reduction models.”
MethodInfluentialA Novel Method of Mutation Clustering Based on Domain Analysis.
Ji, C., Chen, Z., Xu, B., & Zhao, Z. (2009) · Cited by 59
Data mining algorithm for manufacturing process control
Sadoyan, H., Zakarian, A., & Mohanty, P. S. (2005) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-004-2367-1 · Cited by 62
“temperature, velocity, and the number of particles) are clustered into four separate ranges using the k-mean clustering algorithm [26].”
MethodFactors that Impact the Accuracy of Clustering-Based Load Forecasting
Wang, X., Lee, W., Huang, H., Szabados, R. L., Wang, D. Y., & Olinda, P. V. (2016) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2016.2558563 · Cited by 59
“K-means clustering could be described as the following [4]–[6], [8], [11]:”
Patch-Based Semantic Labeling of Road Scene Using Colorized Mobile LiDAR Point Clouds
Luo, H., Wang, C., Wen, C., Cai, Z., Chen, Z., Wang, H., Yu, Y., & Li, J. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2499196 · Cited by 59
“The M3N approach adopted the robust Potts model [29] where the cliques were defined to be the resulting clusters from two k-means segmentations [41] with parameter”
MethodOn Detecting Road Regions in a Single UAV Image
Zhou, H., Kong, H., Wei, L., Creighton, D., & Nahavandi, S. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2622280 · Cited by 59
Chen, Z., Zhang, Y., & Wang, L. (2017) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2658731 · Cited by 60
A Human Activity Recognition System Based on Dynamic Clustering of Skeleton Data
Manzi, A., Dario, P., & Cavallo, F. (2017) · Sensors · doi:10.3390/s17051100 · Cited by 59
“Technically, the K-means algorithm, introduced in [33] and developed in many variations [34,35], is applied several times to the input sequence, varying the desired number of K clusters.”
MethodMRI Brain Tumor Segmentation and Analysis using Rough-Fuzzy C-Means and Shape Based Properties
Bal, A., Banerjee, M., Chakrabarti, A., & Sharma, P. (2018) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2018.11.001 · Cited by 66
Adaptive local-fitting-based active contour model for medical image segmentation
Ma, D., Liao, Q., Chen, Z., Liao, R., & Ma, H. (2019) · Signal Processing Image Communication · doi:10.1016/j.image.2019.05.006 · Cited by 62
Consensus guided incomplete multi-view spectral clustering
Wen, J., Sun, H., Fei, L., Li, J., Zhang, Z., & Zhang, B. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.10.014 · Cited by 62
Sakhnevych, A. (2021) · Vehicle System Dynamics · doi:10.1080/00423114.2021.1977833 · Cited by 58
Jardim, S., & de Mora, C. L. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2021.12.006 · Cited by 58
Rahman, M. M., Uzzaman, A., Khatun, F., Aktaruzzaman, M., & Siddique, N. H. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125929 · Cited by 64
Cai, X., Chan, R. H., Nikolova, M., & Zeng, T. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0402-2 · Cited by 61
“The second stage is to use the K-means algorithm [28] to determine the thresholds for segmentation.”
MethodMünch, B., Martin, L. H. J., & Leemann, A. (2015) · Journal of Microscopy · doi:10.1111/jmi.12309 · Cited by 58
“Various categories of clustering algorithms are known based on centroids (e.g. fuzzy c-means, Bezdek et al., 1984; k-means, Kanungo et al., 2002), connectivity of agglomerates (e.g. nearest neighbour clustering, Sibson, 1973), statistical distribution (e.g. expectation maximization, Dempster et…”
BackgroundA new multistage approach to detect subtle DDoS attacks
Wang, F., Wang, H., Wang, X., & Su, J. (2011) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2011.02.025 · Cited by 58
Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means
Pourkamali‐Anaraki, F., & Becker, S. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2672725 · Cited by 58
Energy optimization in wireless sensor networks using a hybrid K-means PSO clustering algorithm
Solaiman, B., & Sheta, A. F. (2016) · TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES · doi:10.3906/elk-1403-293 · Cited by 58
“It was applied to partition a network into number of clusters [27, 28, 29].”
MethodAdaptive Nature-Inspired Fog Architecture
Kimovski, D., Ijaz, H., Saurabh, N., & Prodan, R. (2018) · IEEE International Conference on Fog and Edge Computing (ICFEC) · doi:10.1109/cfec.2018.8358723 · Cited by 62
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.