High-order manifold regularized multi-view subspace clustering with robust affinity matrices and weighted TNN

被引:17
作者
Cai, Bing [1 ]
Lu, Gui-Fu [1 ]
Yao, Liang [1 ]
Li, Hua [1 ]
机构
[1] Anhui Polytech Univ, Sch Comp & Informat, Wuhu 241000, Anhui, Peoples R China
基金
安徽省自然科学基金;
关键词
High-order manifold regularization; Robust affinity matrices; Multi-view subspace clustering; Weighted TNN; FRAMEWORK;
D O I
10.1016/j.patcog.2022.109067
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view subspace clustering achieves impressive performance for high-dimensional data. However, many of these models do not sufficiently mine the intrinsic information among samples and consider the robustness problem of the affinity matrices, resulting in the degradation of clustering performance. To address these problems, we propose a novel high-order manifold regularized multi-view subspace clus-tering with robust affinity matrices and a weighted tensor nuclear norm (TNN) model (termed HMRMSC) to characterize real-world data. Specifically, all the similarity matrices of different views are first stacked into a third-order tensor. However, the constructed tensor may contain an additional inter-class represen-tation since the data are usually noisy. Then, we use a technique similar to tensor principal component analysis (TPCA) to obtain a more robust similarity tensor, which is constrained by the so-called weighted TNN since the original TNN treats each singular value equally and usually considers no prior informa-tion of singular values. In addition, a high-order manifold regularized term is also added to utilize the manifold information of data. Finally, all the steps are unified into a framework, which is resolved by the augmented Lagrange multiplier (ALM) method. Experimental results on six representative datasets show that our model outperforms several state-of-the-art counterparts. (c) 2022 Elsevier Ltd. All rights reserved.
引用
收藏
页数:12
相关论文
共 48 条
  • [1] Belkin M, 2006, J MACH LEARN RES, V7, P2399
  • [2] Multi-view low-rank sparse subspace clustering
    Brbic, Maria
    Kopriva, Ivica
    [J]. PATTERN RECOGNITION, 2018, 73 : 247 - 258
  • [3] Chakraborty S, 2020, METHODOLOGY-EUR
  • [4] Chakraborty S., 2020, IEEE T PATTERN ANAL
  • [5] Chakraborty S, 2021, AAAI CONF ARTIF INTE, V35, P6930
  • [6] Chakraborty S, 2020, PR MACH LEARN RES, V108, P691
  • [7] The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
    Chen, Caihua
    He, Bingsheng
    Ye, Yinyu
    Yuan, Xiaoming
    [J]. MATHEMATICAL PROGRAMMING, 2016, 155 (1-2) : 57 - 79
  • [8] Multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix
    Chen, Yongyong
    Xiao, Xiaolin
    Zhou, Yicong
    [J]. PATTERN RECOGNITION, 2020, 106
  • [9] Convex Biclustering
    Chi, Eric C.
    Allen, Genevera I.
    Baraniuk, Richard G.
    [J]. BIOMETRICS, 2017, 73 (01) : 10 - 19
  • [10] Du L, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P3476