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

投影聚类的线性时间算法

Linear Time Algorithm for Projective Clustering

Hu Ding, Jinhui Xu

摘要:

投影聚类是一个具有重要理论和实际意义的问题,近年来受到了广泛的关注。给定$\mathbb{R}^{d}$空间中的一组点$P$,投影聚类是找到$k$低维$j$ -平坦的一组$\mathbb{F}$,使得从$P$中的点到它们最近的平坦的平均距离(或平方距离)最小化。针对这个问题的现有方法主要是基于自适应/体积采样或核心集技术,这些技术受到几个限制。在本文中,我们提出了第一个均匀随机抽样为基础的方法,这一具有挑战性的问题,并实现线性时间的解决方案,一般投影聚类,定期投影聚类,和$L_τ$感投影聚类。对于一般的投影聚类问题,我们表明,对于任何给定的小数目$0<γ, ε<1$,我们的方法首先删除$γ|P|$点作为离群值,然后确定$k$ $j$ -单位到$k$集群与一个目标值不超过所有点的最佳$(1+ε)$倍的剩余点。对于常规的投影聚类,我们证明了当输入点满足一些合理的假设,其输入,我们的一般情况下的方法可以扩展到产生一个PTAS的所有点。对于$L_τ$意义上的投影聚类,我们表明,我们的技术一般和定期的情况下,可以自然地扩展到任何$1 \le τ< \infty$的$L_τ$意义上的投影聚类问题。我们的研究结果是基于几个新的技术,如板分割,$Δ$旋转,对称采样,递归投影,并可以很容易地实现的应用程序。

英文摘要:

Projective clustering is a problem with both theoretical and practical importance and has received a great deal of attentions in recent years. Given a set of points $P$ in $\mathbb{R}^{d}$ space, projective clustering is to find a set $\mathbb{F}$ of $k$ lower dimensional $j$-flats so that the average distance (or squared distance) from points in $P$ to their closest flats is minimized. Existing approaches for this problem are mainly based on adaptive/volume sampling or core-sets techniques which suffer from several limitations. In this paper, we present the first uniform random sampling based approach for this challenging problem and achieve linear time solutions for three cases, general projective clustering, regular projective clustering, and $L_τ$ sense projective clustering. For the general projective clustering problem, we show that for any given small numbers $0<γ, ε<1$, our approach first removes $γ|P|$ points as outliers and then determines $k$ $j$-flats to cluster the remaining points into $k$ clusters with an objective value no more than $(1+ε)$ times of the optimal for all points. For regular projective clustering, we demonstrate that when the input points satisfy some reasonable assumption on its input, our approach for the general case can be extended to yield a PTAS for all points. For $L_τ$ sense projective clustering, we show that our techniques for both the general and regular cases can be naturally extended to the $L_τ$ sense projective clustering problem for any $1 \le τ< \infty$. Our results are based on several novel techniques, such as slab partition, $Δ$-rotation, symmetric sampling, and recursive projection, and can be easily implemented for applications.

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

↑