arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2010.14487cs.LGcs.DS
收藏

改进的k-means++和k-means++并行保证

Improved Guarantees for k-means++ and k-means++ Parallel

Northwestern University(西北大学)

Konstantin Makarychev, Aravind Reddy, Liren Shan

摘要:

在本文中,我们研究了k-means++和k-means++并行,经典的k-means聚类问题的两个最流行的算法。我们提供了新的分析,并显示改进的近似和双标准近似保证k-means++和k-means++并行。我们的研究结果给出了一个更好的理论理由,为什么这些算法在实践中表现非常好。我们还提出了一个新的变种k-means++并行算法(指数种族k-means++),具有相同的近似保证k-means++。

英文摘要:

In this paper, we study k-means++ and k-means++ parallel, the two most popular algorithms for the classic k-means clustering problem. We provide novel analyses and show improved approximation and bi-criteria approximation guarantees for k-means++ and k-means++ parallel. Our results give a better theoretical justification for why these algorithms perform extremely well in practice. We also propose a new variant of k-means++ parallel algorithm (Exponential Race k-means++) that has the same approximation guarantees as k-means++.

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

↑