arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.07381cs.DScs.CG
收藏

低维$k$ -均值的一种快速逼近格式

A Fast Approximation Scheme for Low-Dimensional $k$-Means

Vincent Cohen-Addad

摘要:

在$d$维欧氏空间中考虑了流行的$k$ -均值问题.最近Friggstad,Rezapour,Salavatipour [FOCS'16]和Cohen-Addad,Klein,Mathieu [FOCS'16]表明,标准的局部搜索算法在时间上产生$(1+ε)$ -近似$(n \cdot k)^{1/ε^{O(d)}}$,给出了低维欧氏空间中问题的第一个多项式时间近似方案。虽然局部搜索实现了最佳近似保证,但它无法与最先进的算法(如著名的$k$ -means++和$D^2$ -sampling算法)竞争。在本文中,我们的目的是弥合理论和实践之间的差距,通过给出一个$(1+ε)$ -近似算法的低维$k$ -手段运行的时间$n \cdot k \cdot (\log n)^{(dε^{-1})^{O(d)}}$,因此匹配的运行时间的$k$ -手段++和$D^2$ -采样算法的多对数因子。我们加快了本地搜索的方法,使一个非标准的使用随机解剖,允许找到最好的本地移动有效地使用一个非常简单的动态程序。我们希望我们的技术可以帮助设计更好的局部搜索算法的几何问题。我们注意到,$d$上的双指数依赖性是必要的,因为$k$ -means在维度$d = ω(\log n)$上是APX硬的。

英文摘要:

We consider the popular $k$-means problem in $d$-dimensional Euclidean space. Recently Friggstad, Rezapour, Salavatipour [FOCS'16] and Cohen-Addad, Klein, Mathieu [FOCS'16] showed that the standard local search algorithm yields a $(1+ε)$-approximation in time $(n \cdot k)^{1/ε^{O(d)}}$, giving the first polynomial-time approximation scheme for the problem in low-dimensional Euclidean space. While local search achieves optimal approximation guarantees, it is not competitive with the state-of-the-art heuristics such as the famous $k$-means++ and $D^2$-sampling algorithms. In this paper, we aim at bridging the gap between theory and practice by giving a $(1+ε)$-approximation algorithm for low-dimensional $k$-means running in time $n \cdot k \cdot (\log n)^{(dε^{-1})^{O(d)}}$, and so matching the running time of the $k$-means++ and $D^2$-sampling heuristics up to polylogarithmic factors. We speed-up the local search approach by making a non-standard use of randomized dissections that allows to find the best local move efficiently using a quite simple dynamic program. We hope that our techniques could help design better local search heuristics for geometric problems. We note that the doubly exponential dependency on $d$ is necessary as $k$-means is APX-hard in dimension $d = ω(\log n)$.

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

↑