On the Consistency of $k$-means++ algorithm
Machine Learning
2017-02-22 v1
Abstract
We prove in this paper that the expected value of the objective function of the -means++ algorithm for samples converges to population expected value. As -means++, for samples, provides with constant factor approximation for -means objectives, such an approximation can be achieved for the population with increase of the sample size. This result is of potential practical relevance when one is considering using subsampling when clustering large data sets (large data bases).
Cite
@article{arxiv.1702.06120,
title = {On the Consistency of $k$-means++ algorithm},
author = {Mieczysław A. Kłopotek},
journal= {arXiv preprint arXiv:1702.06120},
year = {2017}
}