首页> 外文会议>AAAI Conference on Artificial Intelligence >Tensor-SVD Based Graph Learning for Multi-View Subspace Clustering
【24h】

Tensor-SVD Based Graph Learning for Multi-View Subspace Clustering

机译:基于TensoR-SVD的图表学习多视图子空间聚类

获取原文
获取外文期刊封面目录资料

摘要

Low-rank representation based on tensor-Singular Value Decomposition (t-SVD) has achieved impressive results for multi-view subspace clustering, but it does not well deal with noise and illumination changes embedded in multi-view data. The major reason is that all the singular values have the same contribution in tensor-nuclear norm based on t-SVD, which does not make sense in the existence of noise and illumination change. To improve the robustness and clustering performance, we study the weighted tensor-nuclear norm based on t-SVD and develop an efficient algorithm to optimize the weighted tensor-nuclear norm minimization (WTNNM) problem. We further apply the WTNNM algorithm to multi-view subspace clustering by exploiting the high order correlations embedded in different views. Extensive experimental results reveal that our WTNNM method is superior to several state-of-the-art multi-view subspace clustering methods in terms of performance.
机译:基于Tensor-奇异值分解(T-SVD)的低秩表示已经实现了多视图子空间聚类的令人印象深刻的结果,但它并不是嵌入在多视图数据中嵌入的噪声和照明变化。 主要原因是基于T-SVD的抗度核标准的所有奇异值都具有相同的贡献,这在存在噪声和照明变化中没有意义。 为提高稳健性和聚类性能,我们研究了基于T-SVD的加权张力核标准,并开发了一种高效的算法,优化了加权抗核常数最小化(WTNNM)问题。 我们通过利用嵌入在不同视图中的高阶相关性来进一步将WTNNM算法应用于多视图子空间群集。 广泛的实验结果表明,在性能方面,我们的WTNNM方法优于几种最先进的多视图子空间聚类方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号