High-order Complementarity Induced Fast Multi-View Clustering with Enhanced Tensor Rank Minimization

被引:7
作者
Ji, Jintian [1 ,2 ]
Feng, Songhe [1 ,2 ]
机构
[1] Beijing Jiaotong Univ, Lab Big Data & Artificial Intelligence Transporta, Minist Educ, Beijing, Peoples R China
[2] Beijing Jiaotong Univ, Sch Comp & Informat Technol, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2023 | 2023年
关键词
Tensor-based multi-view clustering; Matrix factorization; High-order consistency; High-order complementarity;
D O I
10.1145/3581783.3611733
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, tensor-based multi-view clustering methods have achieved promising results, primarily benefited from their superior ability in exploring high-order consistent information among views. Despite significant progress, these methods inevitably suffer from several drawbacks: 1) Extremely high computational complexity restricts their feasibility for large-scale data sets. 2) Prevalently adopted tensor rank approximations (e.g., Tensor Nuclear Norm (TNN)) tend to under-penalize small singular values, resulting in noise residuals. 3) Tensor structure is rarely utilized for high-order complementarity investigation. In light of this, we propose High-order Complementarity Induced Fast Multi-View Clustering with Enhanced Tensor Rank Minimization (CFMVC-ETR). Specifically, two sets of representation matrices are learned from original multi-view data via the matrix factorization mechanism with a group of base matrices, which are further reconstructed into the consistent tensor and the complementary tensor, respectively. Subsequently, a novel Enhanced Tensor Rank is imposed on the consistent tensor, which is a tighter approximation of the tensor rank and is more noisy-robust to explore the high-order consistency. Meanwhile, a tensor-level constraint termed Tensorial Exclusive Regularization is proposed on the complementary tensor to enhance the view-specific feature and well capture the high-order complementarity. Moreover, we adopt a concatenation-fusion approach to integrate these two parts, deriving a discriminative unified embedding for the clustering task. We solve CFMVC-ETR by an efficient algorithm with good convergence. Extensive experiments on nine challenging data sets demonstrate the superiority of the proposed method.
引用
收藏
页码:328 / 336
页数:9
相关论文
共 48 条
  • [1] Algorithms and applications for approximate nonnegative matrix factorization
    Berry, Michael W.
    Browne, Murray
    Langville, Amy N.
    Pauca, V. Paul
    Plemmons, Robert J.
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2007, 52 (01) : 155 - 173
  • [2] Blumensath T, 2014, EUR SIGNAL PR CONF, P1163
  • [3] Diversity-induced Multi-view Subspace Clustering
    Cao, Xiaochun
    Zhang, Changqing
    Fu, Huazhu
    Liu, Si
    Zhang, Hua
    [J]. 2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, : 586 - 594
  • [4] Low-Rank Tensor Based Proximity Learning for Multi-View Clustering
    Chen, Man-Sheng
    Wang, Chang-Dong
    Lai, Jian-Huang
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (05) : 5076 - 5090
  • [5] Low-Rank Tensor Graph Learning for Multi-View Subspace Clustering
    Chen, Yongyong
    Xiao, Xiaolin
    Peng, Chong
    Lu, Guangming
    Zhou, Yicong
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2022, 32 (01) : 92 - 104
  • [6] Chris D., 2006, P 12 ACM SIGKDD INT, P12635, DOI [10.1145/1150402.1150420, DOI 10.1145/1150402.1150420]
  • [7] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES
    COOLEY, JW
    TUKEY, JW
    [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &
  • [8] Ding C, 2005, SIAM PROC S, P606
  • [9] Dinh T. P., 1997, Acta Math. Vietnam, V22, P289
  • [10] Gao QX, 2020, AAAI CONF ARTIF INTE, V34, P3930