

























Abstract:The k-means problem is perhaps the classical clustering problem and often synonymous with Lloyd's algorithm (1957). It has become clear that Hartigan's algorithm (1975) gives better results in almost all cases, Telgarsky-Vattani note a typical improvement of $5\%$ -- $10\%$. We point out that a very minor variation of Hartigan's method leads to another $2\%$ -- $5\%$ improvement; the improvement tends to become larger when either dimension or $k$ increase.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.21798 [cs.LG] |
| (or arXiv:2604.21798v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.21798 arXiv-issued DOI via DataCite (pending registration) |
From: François Clément [view email]
[v1]
Thu, 23 Apr 2026 15:57:05 UTC (270 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。