Simple and sharp analysis of k-means||
Data Structures and Algorithms
2020-07-03 v2
Abstract
We present a simple analysis of k-means|| (Bahmani et al., PVLDB 2012) -- a distributed variant of the k-means++ algorithm (Arthur and Vassilvitskii, SODA 2007). Moreover, the bound on the number of rounds is improved from to , which we show to be tight.
Cite
@article{arxiv.2003.02518,
title = {Simple and sharp analysis of k-means||},
author = {Václav Rozhoň},
journal= {arXiv preprint arXiv:2003.02518},
year = {2020}
}