Anchors Crash Tensor: Efficient and Scalable Tensorial Multi-View Subspace Clustering

被引:0
作者
Ji, Jintian [1 ,2 ]
Feng, Songhe [1 ,2 ]
机构
[1] Beijing Jiaotong Univ, Sch Comp Sci & Technol, Beijing 100044, Peoples R China
[2] Beijing Jiaotong Univ, Key Lab Big Data & Artificial Intelligence Transpo, Minist Educ, Beijing 100044, Peoples R China
基金
北京市自然科学基金;
关键词
Tensors; Clustering algorithms; Correlation; Representation learning; Convergence; Singular value decomposition; Kernel; Fast Fourier transforms; Clustering methods; Bipartite graph; Multi-view clustering; subspace clustering; low-rank tensor learning; anchor representation learning; MINIMIZATION; ROBUST;
D O I
10.1109/TPAMI.2025.3526790
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Tensorial Multi-view Clustering (TMC), a prominent approach in multi-view clustering, leverages low-rank tensor learning to capture high-order correlation among views for consistent clustering structure identification. Despite its promising performance, the TMC algorithms face three key challenges: 1). The severe computational burden makes it difficult for TMC methods to handle large-scale datasets. 2). Estimation bias problem caused by the convex surrogate of the tensor rank. 3). Lack of explicit balance of consistency and complementarity. Being aware of these, we propose a basic framework Efficient and Scalable Tensorial Multi-View Subspace Clustering (ESTMC) for large-scale multi-view clustering. ESTMC integrates anchor representation learning and non-convex function-based low-rank tensor learning with a Generalized Non-convex Tensor Rank (GNTR) into a unified objective function, which enhances the efficiency of the existing subspace-based TMC framework. Furthermore, a novel model ESTMC-C-2 with the proposed Enhanced Tensor Rank (ETR), Consistent Geometric Regularization (CGR), and Tensorial Exclusive Regularization (TER) is extended to balance the learning of consistency and complementarity among views, delivering divisible representations for the clustering task. Efficient iterative optimization algorithms are designed to solve the proposed ESTMC and ESTMC-C-2, which enjoy time-economical complexity and exhibit theoretical convergence. Extensive experimental results on various datasets demonstrate the superiority of the proposed algorithms as compared to state-of-the-art methods.
引用
收藏
页码:2660 / 2675
页数:16
相关论文
共 71 条
  • [1] Bartle R.G., 2000, Introduction to Real Analysis, V2
  • [2] Boyd SP, 2004, Convex Optimization, DOI 10.1017/CBO9780511804441
  • [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] Chao Guoqing, 2021, IEEE Trans Artif Intell, V2, P146, DOI 10.1109/tai.2021.3065894
  • [5] Chen M., 2010, arXiv
  • [6] Efficient Orthogonal Multi-view Subspace Clustering
    Chen, Man-Sheng
    Wang, Chang-Dong
    Huang, Dong
    Lai, Jian-Huang
    Yu, Philip S.
    [J]. PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 127 - 135
  • [7] 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
  • [8] Multiview Subspace Clustering With Grouping Effect
    Chen, Man-Sheng
    Huang, Ling
    Wang, Chang-Dong
    Huang, Dong
    Yu, Philip S.
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (08) : 7655 - 7668
  • [9] Self-Paced Enhanced Low-Rank Tensor Kernelized Multi-View Subspace Clustering
    Chen, Yongyong
    Wang, Shuqin
    Xiao, Xiaolin
    Liu, Youfa
    Hua, Zhongyun
    Zhou, Yicong
    [J]. IEEE TRANSACTIONS ON MULTIMEDIA, 2022, 24 : 4054 - 4066
  • [10] Generalized Nonconvex Low-Rank Tensor Approximation for Multi-View Subspace Clustering
    Chen, Yongyong
    Wang, Shuqin
    Peng, Chong
    Hua, Zhongyun
    Zhou, Yicong
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2021, 30 : 4022 - 4035