Scalable tri-factorization guided multi-view subspace clustering

被引:0
作者
Zhang, Guang-Yu [1 ]
Guan, Chang-Bin [1 ,2 ]
Huang, Dong [1 ]
Wen, Zihao [1 ]
Wang, Chang-Dong [3 ,4 ]
Xiao, Lei [1 ]
机构
[1] South China Agr Univ, Coll Math & Informat, Guangzhou, Peoples R China
[2] State Key Lab Swine & Poultry Breeding Ind, Guangzhou, Peoples R China
[3] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou, Peoples R China
[4] Guangdong Key Lab Big Data Anal & Proc, Guangzhou, Peoples R China
关键词
Data clustering; Multi-view clustering; Anchor-based multi-view subspace clustering; Tri-factorization; Low-rank tensor learning;
D O I
10.1016/j.knosys.2025.113119
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Anchor-based Multi-view Subspace Clustering (AMSC) has exhibited its outstanding capability in large-scale multi-view clustering. Despite significant progress, previous AMSC approaches still suffer from two limitations. First, they mostly neglect the high-order correlation, which undermines their ability in discovering complex cluster structures. Second, they frequently overlook the potential connection between multi-view dimension reduction and anchor subspace clustering, which affects their robustness to low-quality views. In view of these issues, we present a Scalable Tri-factorization Guided Multi-view Subspace Clustering (ST-MSC) approach. Specifically, the proposed approach seeks to recover the latent sample-anchor relationships in multiple embedded spaces, where the multi-view anchor representations are stacked into a low-rank tensor to enhance their high-order correlations with tri-factorization guidance. Theoretical analysis indicates that the tri-factorization paradigm has inherent relevance with two mutually beneficial tasks, namely, the multi-view dimensionality reduction and the anchor-based multi-view subspace clustering. Furthermore, a simple yet fast algorithm is devised to minimize the objective model, where the latent embedding spaces and the anchor subspace structure can be iteratively updated in a unified manner. Experiments have been conducted to verify the effectiveness and efficiency of our ST-MSC approach in comparison with the advanced approaches.
引用
收藏
页数:16
相关论文
共 56 条
  • [1] Aggarwal CC, 2001, SIGMOD RECORD, V30, P37
  • [2] Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clustering
    Cai, Xiaosha
    Huang, Dong
    Zhang, Guang-Yu
    Wang, Chang-Dong
    [J]. INFORMATION FUSION, 2023, 91 : 364 - 375
  • [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] Multi-view clustering via deep concept factorization
    Chang, Shuai
    Hu, Jie
    Li, Tianrui
    Wang, Hao
    Peng, Bo
    [J]. KNOWLEDGE-BASED SYSTEMS, 2021, 217
  • [5] Concept Factorization Based Multiview Clustering for Large-Scale Data
    Chen, Man-Sheng
    Wang, Chang-Dong
    Huang, Dong
    Lai, Jian-Huang
    Yu, Philip S.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) : 5784 - 5796
  • [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] Chen MS, 2020, AAAI CONF ARTIF INTE, V34, P3513
  • [8] Chen X, 2011, ELECTRON J QUAL THEO, P1
  • [9] Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning
    Fang, Si-Guo
    Huang, Dong
    Cai, Xiao-Sha
    Wang, Chang-Dong
    He, Chaobo
    Tang, Yong
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (08) : 11436 - 11447
  • [10] Multi-View Subspace Clustering
    Gao, Hongchang
    Nie, Feiping
    Li, Xuelong
    Huang, Heng
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 4238 - 4246