A Batched Hartigan's k-Means Clustering
cs.LG
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- An effective variant of the Hartigan $k$-means algorithm
- The Catastrophic Failure of The k-Means Algorithm in High Dimensions, and How Hartigan's Algorithm Avoids It
- Further heuristics for $k$-means: The merge-and-split heuristic and the $(k,l)$-means
- Bringing UMAP Closer to the Speed of Light with GPU Acceleration
- GPU Semiring Primitives for Sparse Neighborhood Methods
- Exact Acceleration of K-Means++ and K-Means$\|$
- Flash-KMeans: Fast and Memory-Efficient Exact K-Means
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis