- Conference Paper
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(logn) to O(logn/loglogn), which we show to be tight.
Journal / seriesProceedings of Machine Learning Research
Pages / Article No.
Organisational unit09587 - Ghaffari, Mohsen / Ghaffari, Mohsen
NotesDue to the Coronavirus (COVID-19) the conference was conducted virtually.
MoreShow all metadata