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

一般情况下的一致k-聚类

Consistent k-Clustering for General Metrics

Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson

摘要:

给定度量空间中的点流,在算法的整个执行过程中,是否可以通过仅少量改变聚类中心来保持恒定的近似聚类?这个问题近年来在机器学习文献中受到关注,并且在我们的工作之前,最知名的算法执行$\widetilde{O}(k^2)$中心交换($\widetilde{O}(\cdot)$符号隐藏输入实例的点数$n$和纵横比$Δ$中的多对数因子)。与离线情况相比,这是一个二次增长--整个流是预先已知的,人们对在任何时间点保持恒定的近似值感兴趣--对于离线情况,已知$\widetilde{O}(k)$交换是足够的,简单的例子表明$Ω(k \log(n Δ))$交换是必要的。我们通过开发一种算法来缩小这一差距,该算法可能令人惊讶地匹配离线设置中的保证。具体来说,我们将展示如何保持一个恒定的因素近似的$k$中位数的问题,通过执行一个最佳的(最多polymimic因素)的中心交换数$\widetilde{O}(k)$。为了获得我们的结果,我们利用新的结构特性的$k$ -中值聚类,可能是独立的利益。

英文摘要:

Given a stream of points in a metric space, is it possible to maintain a constant approximate clustering by changing the cluster centers only a small number of times during the entire execution of the algorithm? This question received attention in recent years in the machine learning literature and, before our work, the best known algorithm performs $\widetilde{O}(k^2)$ center swaps (the $\widetilde{O}(\cdot)$ notation hides polylogarithmic factors in the number of points $n$ and the aspect ratio $Δ$ of the input instance). This is a quadratic increase compared to the offline case -- the whole stream is known in advance and one is interested in keeping a constant approximation at any point in time -- for which $\widetilde{O}(k)$ swaps are known to be sufficient and simple examples show that $Ω(k \log(n Δ))$ swaps are necessary. We close this gap by developing an algorithm that, perhaps surprisingly, matches the guarantees in the offline setting. Specifically, we show how to maintain a constant-factor approximation for the $k$-median problem by performing an optimal (up to polylogarithimic factors) number $\widetilde{O}(k)$ of center swaps. To obtain our result we leverage new structural properties of $k$-median clustering that may be of independent interest.

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

↑