Monte Carlo approximation certificates for k-means clustering
arXiv: Machine Learning, 2017.
Efficient algorithms for $k$-means clustering frequently converge to suboptimal partitions, and given a partition, it is difficult to detect $k$-means optimality. In this paper, we develop an a posteriori certifier of approximate optimality for $k$-means clustering. The certifier is a sub-linear Monte Carlo algorithm based on Peng and Wei...More
Full Text (Upload PDF)
PPT (Upload PPT)