# Fixed-sized clusters k-Means

arXiv: https://arxiv.org/abs/2501.16113 · HTML: https://mlsanity.com/paper/2501.16113/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 16 references that are in the map.
- First posted on arXiv 27 Jan 2025.

## Abstract (arXiv)

We present a k-means-based clustering algorithm, which optimizes the mean square error, for given cluster sizes. A straightforward application is balanced clustering, where the sizes of each cluster are equal. In the k-means assignment phase, the algorithm solves an assignment problem using the Hungarian algorithm. This makes the assignment phase time complexity O(n3). This enables clustering of datasets of size more than 5000 points.