The DOI matches its Crossref record; 39 of the 41 references it cites were found in a registry or an index.
A Fast Adaptive k-means with No Bounds
Abstract
This paper presents a novel accelerated exact k-means called as "Ball k-means" by using the ball to describe each cluster, which focus on reducing the point-centroid distance computation. The "Ball k-means" can exactly find its neighbor clusters for each cluster, resulting distance computations only between a point and its neighbor clusters' centroids instead of all centroids. What's more, each cluster can be divided into "stable area" and "active area", and the latter one is further divided into some exact "annular area". The assignment of the points in the "stable area" is not changed while the points in each "annular area" will be adjusted within a few neighbor clusters. There are no upper or lower bounds in the whole process. Moreover, ball k-means uses ball clusters and neighbor searching along with multiple novel stratagems for reducing centroid distance computations. In comparison with the current state-of-the art accelerated exact bounded methods, the Yinyang algorithm and the Exponion algorithm, as well as other top-of-the-line tree-based and bounded methods, the ball k-means attains both higher performance and performs fewer distance calculations, especially for large-k problems. The faster speed, no extra parameters and simpler design of "Ball k-means" make it an all-around replacement of the naive k-means.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 24,190
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
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
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
Scalable Recognition with a Vocabulary Tree
Nistér, D., & Stewénius, H. (2006) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2006.264 · Cited by 3,641
Object retrieval with large vocabularies and fast spatial matching
Philbin, J. F., Chum, O., Isard, M., Šivic, J., & Zisserman, A. (2007) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2007.383172 · Cited by 2,931
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,792
Sculley, D. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772862 · Cited by 1,287
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,036
Flagged first, then by citations
2 of the 41 references couldn’t be matched to a known paper.
Research works printed but not linked: 1
- Ortega, 2018, A-means: Improving the cluster assignment phase of k-means for big data, Int. J. Combinatorial Optim. Problems Inform., 9, 3
Cited by
Sorted by citations
Items 101–148 of 148
de Luna, R. G., Batingan, P. C., Berbon, B. B., Kish, M. J., Pecayo, K. M., & Villegas, R. J. L. (2024) · International Conference on Informatics and Computational Sciences (ICICoS) · doi:10.1109/icicos62600.2024.10636916 · Cited by 2
A Parameter-free Clustering Algorithm based K-means
Slaoui, S. C., & Dafir, Z. (2021) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2021.0120372 · Cited by 2
Comparison of Clustering Techniques for Thai Mutual Funds Fee Dataset
Whasphuttisit, J., Jitsakul, W., & Kaewkiriya, T. (2022) · International Conference on Knowledge and Smart Technology · doi:10.1109/kst53302.2022.9729076 · Cited by 2
Multimodal Learning Approach for Multi-topic Twitter Summarization
Cao, Y., Wu, Y., Qi, J., & Chen, Z. (2022) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda55098.2022.9778873 · Cited by 2
Self-citationHRCache: Edge-End Collaboration for Mobile Deep Vision Based on H.264 and Approximated Reuse
Wei, X., Wei, X., Wang, X., Wang, Y., & Niu, Y. (2022) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/ipccc55026.2022.9894326 · Cited by 2
Algebraic, Topological, and Mereological Foundations of Existential Granules
Mani, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-50959-9_13 · Cited by 2
PaD-DBSCAN: Enhancing Parallel DBSCAN Clustering with Density Peak Detection
Wang, Y., Fang, J., Fu, R., & Chao, P. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0811-9_21 · Cited by 1
Towards faster seeding for k -means++ via lower bound and triangle inequality
Zhang, H., & Li, J. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.130227 · Cited by 1
An adaptive representative point-driven granular-ball clustering algorithm
Wang, Z. G., & Zhu, P. (2026) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-026-03131-3 · Cited by 1
Easy Data Augmentation Method for Classification Tasks
Guohang, L., Shibin, Z., Tang, H., Lu, Y., Lu, J., & Yuanyuan, H. (2020) · International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP) · doi:10.1109/iccwamtip51612.2020.9317525 · Cited by 1
A Grammar-Aware Pointer Network for Abstractive Summarization
Zhou, Y., Cao, F., Cao, Y., Yang, N., & Li, Z. (2021) · Smart innovation, systems and technologies · doi:10.1007/978-981-33-6141-6_21 · Cited by 1
Ball K-Medoids: Faster and Exacter
Peng, Q., Zhang, S., Zhang, J., Huang, Y., Boyi, Y., & Tang, H. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-78615-1_16 · Cited by 1
Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules
Wan, X., Liu, C., & Luo, Y. (2023) · Discrete Dynamics in Nature and Society · doi:10.1155/2023/4993855 · Cited by 1
GBCloud: a Robust Cloud Model for Processing Multi-dimensional Data Using Granular-ball Computing
Shi, Y., Xia, S., & Chen, Z. (2023) · International Conference on Mathematics and Artificial Intelligence (ICMAI) · doi:10.1145/3594300.3594301 · Cited by 1
Self-citationBiGuide: A Bi-level Data Acquisition Guidance for Object Detection on Mobile Devices
Duan, L., Chen, Y., Qu, Z., McGrath, M., Ehmke, E. E., & Gorlatova, M. A. (2024) · ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn61024.2024.00012 · Cited by 2
Comparative Analysis Clustering Algorithm for Government’s Budget Performance Data
Ghozali, I. H. A., Afan, I., & Lestari, T. (2024) · CogITo Smart Journal · doi:10.31154/cogito.v10i1.611.578-591 · Cited by 1
kProtoClust: Towards Adaptive k-Prototype Clustering without Known k
Ping, Y., Li, H., Guo, C., & Hao, B. (2025) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2025.057693 · Cited by 1
Deng, J. H., Wei, L., Qiu, C., & Zhang, L. (2025) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-025-02554-8 · Cited by 1
Geometric-k-means: a bound free approach to fast and eco-friendly k-means
Sharma, P., Malec, M., Kurban, H., Külekci, M. O., & Dalkilic, M. M. (2026) · Machine Learning · doi:10.1007/s10994-025-06891-1 · Cited by 1
Mining Student Behavioral Concern Through Referrals Using K-Means Clustering
Saren, J. G., Talirongan, H., Talirongan, F. J. B., & Malicay, C. L. (2021) · International Journal of Research Publications · doi:10.47119/ijrp100711220211768 · Cited by 1
On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm SelectionPreprint
Wang, S., Sun, Y., & Bao, Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.06654 · Cited by 1
Inductive Latent Space Sparse and Low-rank Subspace Clustering Algorithm
Liao, J., Liu, X., & Xie, M. (2022) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2224/1/012124
A Fast Heuristic k-means Algorithm Based on Nearest Neighbor Information
Wang, J., Wen, Q., & Chen, Z. (2022) · Smart innovation, systems and technologies · doi:10.1007/978-981-19-2448-4_11
Self-citationQuality-aware aggregated conformal prediction for silent speech recognition
Xu, K., Zhang, W., Zhang, M., Wang, Y., & Li, G. (2022) · International Conference on Algorithms, Computing and Artificial Intelligence (ACAI) · doi:10.1145/3579654.3579762
EEG-Based Joint Semi-supervised Learning for Major Depressive Disorder Detection
Chen, T., Zheng, T., Shi, J., & Guo, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-37660-3_47
A Nearest Neighbor-Based Hamiltonian Clustering Algorithm
Hachemy, S. E., Boulouz, A., & Eljakani, Y. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-46584-0_4
Comfort Index Reduction Method of High-speed Rail Based on Fisher Score and Granular Ball Rough Set
Zhao, Y., & Wang, H. (2023) · International Conference on Digital Society and Intelligent Systems (DSInS) · doi:10.1109/dsins60115.2023.10455437
SGBCD: A Data Discretization Algorithm Based on Granular-ball Computing and Attribute Significance
Chen, W. (2024) · IEEE International Conference on Electrical Engineering, Big Data and Algorithms (EEBDA) · doi:10.1109/eebda60612.2024.10486018
Small Sample Travel Feature Inference Based on Multi-Clustering Topic Model Over Internet of ThingsPreprint
Liu, H., Shi, H., Yuan, T., Fu, S., & Ran, B. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4824673
Dimensionality Reduction with Adaptive K-Nearest Neighbors Joint Fuzzy C-MeansPreprint
Wang, J., Huang, X., Zhang, C., & Nie, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4835463
Self-citationMa, B., Li, D., Liu, X., Mai, Y., & Qin, S. (2024) · International Conference on Cloud Computing, Big Data Application and Software Engineering (CBASE) · doi:10.1109/cbase64041.2024.10824378
Design and implementation of parallel k-means algorithm based on ternary optical computer
Song, K., Zhang, H., Ma, H., Sun, Y., & Yan, L. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07016-0
Academic Early Warning Model Based on Improved Global K-means Algorithm
Liu, J., Yang, Y., & Qu, F. (2025) · 電腦學刊 · doi:10.63367/199115992025043602008 · Cited by 2
An Efficient Clustering Validity Index Based on Granular-Ball Structure
Hu, H., & Zhang, Y. (2025) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda64898.2025.11030521
Hou, B., Wang, G., Xia, S., & Chen, D. J. (2025) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec65147.2025.11043130
Self-citationWu, C., & Wang, X. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07678-w
Hierarchical clustering algorithm based on an adaptive purified neighborhood graph
Qin, S., Feng, J., Yang, D., & Chen, Z. (2025) · Cluster Computing · doi:10.1007/s10586-025-05350-9
Self-citationSquare Superpixel Generation and Representation Learning via Granular-ball Computing
Zhao, S., Dai, D., Jiang, G., Yu, F., Zhang, C., & Xia, S. (2025) · International Conference on Computer Information Science and Application Technology (CISAT) · doi:10.1109/cisat66811.2025.11181937
Self-citationA generalized arbitrary base euclidean space technique for C-Mean clustering simulation
Sangwan, P., & Kumar, R. (2026) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-025-05014-x
A fast granular ellipsoid-based density peaks clustering algorithm for large-scale data
Liu, S., Li, S., & Yu, F. (2026) · AIMS Mathematics · doi:10.3934/math.2026325
Pei, W., Dai, R., Xue, B., Zhang, M., Zhang, Q., Cheung, Y., & Xia, S. (2026) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2026.3657694
Self-citationGranular Computing Enhanced Federated Learning Framework on Edge Devices
Roy, S. S., & Rastogi, R. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-18480-1_8
Structure-Adaptive Clustering via Multi-scale Ellipsoidal Granules
辛宪伟, Li, H., Yao, Z., Song, Y., Wang, C. D., & Wang, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-0375-8_23
Ibrahim, M. M., Hussein, T. F., & Qasim, O. S. (2026) · AIP conference proceedings · doi:10.1063/5.0329711
Chen, J., Xia, S., Zhao, S., Wang, D., & Peng, C. (2026) · Knowledge-Based Systems · doi:10.1016/j.knosys.2026.116285
Self-citationQian, J., & Su, S. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-8262-4_11
A Clustering Algorithm Based on Dual-Perspective Adaptive Conical Information Granules
Yu, B., Cao, Z., & Fu, Y. (2026) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2026.3708513
Metadata
- Authors
- Xia, S., Peng, D., Meng, D., Zhang, C., Wang, G., Giem, E., Wei, W., & Chen, Z.
- Affiliations
- Chongqing University of Posts and Telecommunications (CN)
- Macau University of Science and Technology (MO)
- Tianjin University (CN)
- University of California, Riverside (US)
- Xi'an University of Technology (CN)
- ORCID
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2020
- Volume
- 44
- Issue
- 1
- Pages
- 1-1
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W3043317456
- Cited by
- 149
- References
- 41
- Citations by year
- 2026: 11 · 2025: 20 · 2024: 34 · 2023: 19 · 2022: 34 · 2021: 24 · 2020: 7
- FWCI
- 8.18
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
- PubMed (publishedVersion)
- Funders
- Natural Science Foundation of Chongqing (cstc2019jcyj-msxmX0485 and cstc2019jcyj-cxttX0002)
- National Basic Research Program of China (2019QY(Y)0301 and 2016QY01W0200)
- National Natural Science Foundation of China (61806030& 61876027&61772096&61533020)
- NICE: NRT for Integrated Computational Entomology US NSF award (1631776)
- 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 › Machine Learning and Data Classification
- Keywords
- K-means clustering, annular area
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
