基于双主成分追踪的超平面聚类
Hyperplane Clustering Via Dual Principal Component Pursuit
摘要:
我们最近提出的单子空间学习算法,称为双主成分追踪(DPCP)的理论分析,从一个联盟的超平面的数据绘制的情况下。为了深入了解与DPCP相关的$\ell_1$非凸问题的性质,我们对一个密切相关的连续优化问题进行了几何分析。然后将这一分析转移到离散问题,我们的结果表明,只要超平面是充分分离的,优势超平面是充分占主导地位的,并在相关的超平面内的点均匀分布,那么非凸DPCP问题有一个唯一的整体解决方案,等于法向量的优势超平面。这表明了基于DPCP的序贯超平面学习算法的正确性。一个彻底的实验评估表明,超平面学习计划的基础上DPCP显着提高了国家的最先进的方法的情况下,合成数据,而竞争力的国家的最先进的情况下,三维平面聚类的Kinect数据。
英文摘要:
We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain insight into the properties of the $\ell_1$ non-convex problem associated with DPCP, we develop a geometric analysis of a closely related continuous optimization problem. Then transferring this analysis to the discrete problem, our results state that as long as the hyperplanes are sufficiently separated, the dominant hyperplane is sufficiently dominant and the points are uniformly distributed inside the associated hyperplanes, then the non-convex DPCP problem has a unique global solution, equal to the normal vector of the dominant hyperplane. This suggests the correctness of a sequential hyperplane learning algorithm based on DPCP. A thorough experimental evaluation reveals that hyperplane learning schemes based on DPCP dramatically improve over the state-of-the-art methods for the case of synthetic data, while are competitive to the state-of-the-art in the case of 3D plane clustering for Kinect data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。