Multi-view clustering with adaptive procrustes on Grassmann manifold

被引:5
作者
Dong, Xia [1 ,2 ,3 ]
Wu, Danyang [4 ,5 ]
Nie, Feiping [1 ,2 ,3 ,6 ]
Wang, Rong [2 ,3 ]
Li, Xuelong [2 ,3 ]
机构
[1] Northwestern Polytech Univ, Sch Comp Sci, Xian 710072, Shaanxi, Peoples R China
[2] Northwestern Polytech Univ, Sch Artificial Intelligence Opt & Elect iOPEN, Xian 710072, Shaanxi, Peoples R China
[3] Northwestern Polytech Univ, Minist Ind & Informat Technol, Key Lab Intelligent Interact & Applicat, Xian 710072, Shaanxi, Peoples R China
[4] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China
[5] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[6] Northwestern Polytech Univ, Sch Artificial Intelligence Opt & Elect iOPEN, Sch Comp Sci, Xian 710072, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-view clustering; Grassmann procrustes; Implicitly weighted learning mechanism; Explicitly weighted learning mechanism; FUSION;
D O I
10.1016/j.ins.2022.07.089
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-view clustering plays an important role in a wide spectrum of applications. In this article, we propose a multi-view clustering approach with adaptive Procrustes on Grassmann manifold (MC-APGM) to overcome the three demerits in existing graph -based multi-view clustering methods, namely, insufficient mining of subspace information of views, a requirement for post-processing, and high computational complexity. Specifically, in the proposed model, the indicator matrix is directly learned from multiple orthogonal spectral embeddings, avoiding the random clustering results caused by post -processing; The orthogonal form of the indicator matrix approximates multiple orthogonal spectral embeddings on the Grassmann manifold, fully uncovering subspace information of views and thus improving clustering performance; Both implicitly and explicitly weighted learning mechanisms are established to capture inconsistencies among different views. Moreover, an efficient algorithm with rigorous convergence guarantee is derived to opti-mize the proposed model. Finally, experimental results on both toy and real-world datasets demonstrate the effectiveness and efficiency of this proposed method.(c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:855 / 875
页数:21
相关论文
共 50 条
  • [1] Absil PA, 2008, OPTIMIZATION ALGORITHMS ON MATRIX MANIFOLDS, P1
  • [2] Boyd S., 2004, CONVEX OPTIMIZATION
  • [3] Chen MS, 2020, AAAI CONF ARTIF INTE, V34, P3513
  • [4] Adaptive Transition Probability Matrix Learning for Multiview Spectral Clustering
    Chen, Yongyong
    Xiao, Xiaolin
    Hua, Zhongyun
    Zhou, Yicong
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (09) : 4712 - 4726
  • [5] Chikuse Y., 2003, Statistics on special manifolds, lecture notes in statistics, V174
  • [6] Hamm J., 2008, P 25 INT C MACHINE L, P376
  • [7] Hartigan J. A., 1979, Applied Statistics, V28, P100, DOI 10.2307/2346830
  • [8] Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding
    Hu, Zhanxuan
    Nie, Feiping
    Wang, Rong
    Li, Xuelong
    [J]. INFORMATION FUSION, 2020, 55 : 251 - 259
  • [9] Huang HC, 2012, PROC CVPR IEEE, P773, DOI 10.1109/CVPR.2012.6247748
  • [10] Huang S, 2021, IEEE T KNOWL DATA EN