arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.11891cs.LGcs.DS
收藏

快速准确的$k$ -通过抑制采样实现均值++

Fast and Accurate $k$-means++ via Rejection Sampling

Google Research(谷歌研究院);University of Cologne(科隆大学);EPFL(洛桑联邦理工学院)

Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson

摘要:

$k$ -means++ \cite{arthur2007k}是一种应用广泛的聚类算法,它易于实现,具有良好的理论保证和较强的经验性能。尽管它被广泛采用,但$k$ -means++有时在大型数据集上速度很慢,因此一个自然的问题是获得具有类似保证的更有效的算法。在本文中,我们提出了一个近线性时间算法的$k$ -均值++播种。有趣的是,我们的算法获得了与$k$ -means++相同的理论保证,并显着改善了快速$k$ -means++播种的早期结果。此外,我们的经验表明,我们的算法是显着快于$k$ -手段++,并获得同等质量的解决方案。

英文摘要:

$k$-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, $k$-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 $k$-means++ seeding. Interestingly our algorithm obtains the same theoretical guarantees as $k$-means++ and significantly improves earlier results on fast $k$-means++ seeding. Moreover, we show empirically that our algorithm is significantly faster than $k$-means++ and obtains solutions of equivalent quality.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑