Cited by 149Advanced Clustering Algorithms ResearchData Mining and Machine Learning ApplicationsMachine Learning and Data Classification

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

Xia, Shuyin, Peng, Daowan, Meng, Deyu, Zhang, Changqing, Wang, Guoyin, Giem, Elisabeth, Wei, Wei, Chen, Zizhong·2020·IEEE Transactions on Pattern Analysis and Machine Intelligence

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

Crossref · 10.1109/tpami.2020.3008694

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

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

  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

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)
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
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