A seeded graph-based nearest-center search (SHEESH) makes k-means with huge k (up to 10^6 clusters) practical on a single CPU, beating GPU Lloyd baselines in the reported experiments.
Each of these steps has a variety of avenues for improvement, see the survey by Ikotun et al
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
A seeded graph-based nearest-center search (SHEESH) makes k-means with huge k (up to 10^6 clusters) practical on a single CPU, beating GPU Lloyd baselines in the reported experiments.