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

K-Means具有多项式平滑复杂度

k-Means has Polynomial Smoothed Complexity

David Arthur, Bodo Manthey, Heiko Röglin

摘要:

k-means方法是最广泛使用的聚类算法之一,它的流行是因为它在实践中的速度。然而,最近,它被证明具有指数最坏情况下的运行时间。为了缩小实际性能与理论分析之间的差距,在平滑分析模型中研究了k-means方法。但是,即使是平滑的分析,到目前为止是不令人满意的边界仍然是超多项式的数据点的数量n。在本文中,我们解决了平滑运行时间的k-means方法。我们证明了平滑迭代次数受n和1/σ的多项式约束,其中σ是高斯扰动的标准差。这意味着,如果任意输入数据集被随机扰动,则k均值方法将在该输入集上以预期的多项式时间运行。

英文摘要:

The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between practical performance and theoretical analysis, the k-means method has been studied in the model of smoothed analysis. But even the smoothed analyses so far are unsatisfactory as the bounds are still super-polynomial in the number n of data points. In this paper, we settle the smoothed running time of the k-means method. We show that the smoothed number of iterations is bounded by a polynomial in n and 1/σ, where σis the standard deviation of the Gaussian perturbations. This means that if an arbitrary input data set is randomly perturbed, then the k-means method will run in expected polynomial time on that input set.

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

↑