Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast and Accurate kk-means++ via Rejection Sampling

Published 22 Dec 2020 in cs.LG and cs.DS | (2012.11891v1)

Abstract: kk-means++ \cite{arthur2007k} is a widely used clustering algorithm that is easy to implement, has nice theoretical guarantees and strong empirical performance. Despite its wide adoption, kk-means++ sometimes suffers from being slow on large data-sets so a natural question has been to obtain more efficient algorithms with similar guarantees. In this paper, we present a near linear time algorithm for kk-means++ seeding. Interestingly our algorithm obtains the same theoretical guarantees as kk-means++ and significantly improves earlier results on fast kk-means++ seeding. Moreover, we show empirically that our algorithm is significantly faster than kk-means++ and obtains solutions of equivalent quality.

Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.