度量学习引导的多流形聚类算法

MULTIPLE MANIFOLD CLUSTERING WITH METRIC LEARNING

  • 摘要: 当流形呈现重叠或交叉时,由于流形交叉点附近的样本通常难以区分,现有的聚类算法往往性能较差。为解决该问题,提出一种能够同时考虑样本间的空间距离与样本局部流形差异的距离度量。基于上述度量,提出的算法在学习过程中能够自适应学习样本空间距离与样本局部流形差异的比重,并使得位于流形交叉点附近的样本计算距离时后者的比重更大,以此来更好地对流形交叉点附近的样本进行区分。实验结果表明,在真实数据集和目标追踪数据集环境下提出的模型相较现有的多流形聚类算法能够取得更好的聚类精度。

     

    Abstract: When manifolds are crossed by each other, many existing manifold clustering methods perform poorly because samples near manifold intersections are usually difficult to distinguish. To solve this problem, a distance metric that can simultaneously consider spatial distance between samples and local manifold difference of samples is proposed. Based on the above metric, the proposed algorithm can adaptively learn the weight of sample spatial distance and local manifold difference during learning, and assign larger weight when calculating distance for samples near manifold intersections to better distinguish samples near intersections. Experimental results on real datasets and object tracking datasets demonstrate that the proposed algorithm can achieve better clustering accuracy compared with existing multi-manifold clustering algorithms.

     

/

返回文章
返回