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

近线性时间扰动下的聚类稳定性

Clustering under Perturbation Stability in Near-Linear Time

Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl

摘要:

在扰动稳定性假设下,研究了低维欧氏空间中基于中心的聚类问题。如果即使所有成对距离受到最多$α$因子的任意扰动,底层最佳集群也继续保持最佳,则实例是$α$稳定的。我们的主要贡献是在提出有效的精确算法$α$ -稳定的聚类实例,其运行时间依赖于近线性的数据集的大小时,$α\ge 2 + \sqrt{3}$。对于$k$ -中心和$k$ -均值问题,我们的算法也实现了对聚类数$k$的多项式依赖,当$α\geq 2 + \sqrt{3} + ε$对于任意固定维数的任意常数$ε> 0$.对于$k$ -中位数,我们的算法在任何固定维度上对$α> 5$的$k$具有多项式依赖性;对于二维的$α\geq 2 + \sqrt{3}$,我们的算法对$k$具有多项式依赖性。我们的算法是简单的,只需要应用技术,如本地搜索或动态规划到一个适当修改的度量空间,结合仔细选择的数据结构。

英文摘要:

We consider the problem of center-based clustering in low-dimensional Euclidean spaces under the perturbation stability assumption. An instance is $α$-stable if the underlying optimal clustering continues to remain optimal even when all pairwise distances are arbitrarily perturbed by a factor of at most $α$. Our main contribution is in presenting efficient exact algorithms for $α$-stable clustering instances whose running times depend near-linearly on the size of the data set when $α\ge 2 + \sqrt{3}$. For $k$-center and $k$-means problems, our algorithms also achieve polynomial dependence on the number of clusters, $k$, when $α\geq 2 + \sqrt{3} + ε$ for any constant $ε> 0$ in any fixed dimension. For $k$-median, our algorithms have polynomial dependence on $k$ for $α> 5$ in any fixed dimension; and for $α\geq 2 + \sqrt{3}$ in two dimensions. Our algorithms are simple, and only require applying techniques such as local search or dynamic programming to a suitably modified metric space, combined with careful choice of data structures.

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

↑