Metraipolis › archive › dc_4c441667daab
A Batched Hartigan's $k$-Means Clustering — arXiv:2611.01207
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01207
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:36:45.251Z
- SHA-256 of the archived text
abe9c09757e353f428fb44ef074d07185303dfb0f1f2fd0c0f4b58483975e337- Stable URL of this page
https://metraipolis.com/documento/dc_4c441667daab
How to cite
A Batched Hartigan's $k$-Means Clustering — arXiv:2611.01207 — arXiv (en), https://arxiv.org/abs/2611.01207 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4c441667daab (Metraipolis archive dc_4c441667daab, sha256 abe9c09757e353f428fb44ef074d07185303dfb0f1f2fd0c0f4b58483975e337)
BibTeX
@misc{dc4c441667daab,
title = {A Batched Hartigan's $k$-Means Clustering — arXiv:2611.01207},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01207},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4c441667daab; sha256 abe9c09757e353f428fb44ef074d07185303dfb0f1f2fd0c0f4b58483975e337},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01207. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hartigan's $k$-means algorithm has theoretical advantages over the standard Lloyd's variant, which has become synonymous with "$k$-means". Yet, Hartigan's algorithm is far slower in practice due to its inherently sequential calculations. We devise a Batched Hartigan's method that enables vectorized calculation by exploiting the triangle inequality to expose a set of parallel-safe updates and a smaller set of sequential updates. This makes Hartigan's method competitive with Lloyd's in execution speed for the first time. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.01207 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:12:54.482Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).