论文标题
简单而尖锐的K均值分析||
Simple and sharp analysis of k-means||
论文作者
论文摘要
我们提供了对K-均值的简单分析|| （Bahmani等，PVLDB 2012） - K-Means ++算法的分布式变体（Arthur和Vassilvitskii，Soda 2007）。此外，回合数量的界限从$ O（\ log n）$提高到$ O（\ log n / \ log \ log \ log n）$，我们表明这很紧。
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 $O(\log n)$ to $O(\log n / \log\log n)$, which we show to be tight.
