Prior Indicator Guided Anchor Learning for Multi-View Subspace Clustering

被引:2
|
作者
Wu, Xi [1 ,2 ]
Wang, Hanchen [2 ]
Li, Shuxiao [1 ,2 ]
Dai, Jian [3 ]
Ren, Zhenwen [1 ,2 ]
机构
[1] Southwest Univ Sci & Technol, Sch Natl Def Sci & Technol, Mianyang 621010, Peoples R China
[2] Guangxi Key Lab Digital Infrastruct, Nanning 530201, Peoples R China
[3] Southwest Univ Sci & Technol, Sch Natl Def Sci & Technol, Mianyang 621010, Peoples R China
关键词
Bipartite graph; Task analysis; Optimization; Faces; Complexity theory; Time complexity; Symmetric matrices; Multi-view subspace clustering; sampling learning; large-scale clustering; anchor learning; ALGORITHM;
D O I
10.1109/TCE.2023.3319018
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Despite multi-view subspace clustering (MVSC) has the widespread utilization in practical scenarios, the majority of existing methods face challenges when confronted with large-scale data. To address this issue, the anchor strategies have been proposed, but they mainly face the following problems: (1) most methods use heuristic anchor sampling results in weak discrimination of anchors, as it separates anchor sampling and graph construction; (2) the distribution of anchors within the cluster is uneven, and have low goodness-of-fit between anchors and raw data. To tackle the aforementioned issues effectively, we propose a method named Prior Indicator Guided Anchor Learning for Multi-view Subspace Clustering (PIAL). Specifically, PIAL proposes a unified framework, which can adaptively learn anchors and bipartite graph. Most importantly, PIAL introduces the prior indicator to constrain the bipartite graph learning. In this way, these two frameworks synergistically promote each other to acquire a high-quality anchor graph, such that more flexible and discriminant anchors can be obtained. Moreover, PIAL allows large-scale data to be processed in linear time, which is beneficial for large tasks. Experiments are carried out on several real-world benchmarks and compared with some state-of-the-art methods to verify the comparability and availability of PIAL.
引用
收藏
页码:144 / 154
页数:11
相关论文
共 50 条
  • [21] Dual Consensus Anchor Learning for Fast Multi-View Clustering
    Qin, Yalan
    Qin, Chuan
    Zhang, Xinpeng
    Feng, Guorui
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2024, 33 : 5298 - 5311
  • [22] Relative Comparison-Based Consensus Learning for Multi-View Subspace Clustering
    Xiao, Xiaolin
    Wu, Yue
    Gong, Yue-Jiao
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2024, 34 (12) : 12376 - 12387
  • [23] Multi-Manifold Optimization for Multi-View Subspace Clustering
    Khan, Aparajita
    Maji, Pradipta
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (08) : 3895 - 3907
  • [24] Anchor Pseudo-Supervise Large-Scale Incomplete Multi-View Clustering
    Zhu, Songbai
    Dai, Jian
    Yang, Guolai
    Ren, Zhenwen
    IEEE ACCESS, 2023, 11 : 107812 - 107822
  • [25] Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance
    Wang, Siwei
    Liu, Xinwang
    Zhu, Xinzhong
    Zhang, Pei
    Zhang, Yi
    Gao, Feng
    Zhu, En
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2022, 31 : 556 - 568
  • [26] Large-scale multi-view subspace clustering with latent centroid anchor guidance
    Han, Chengming
    Wu, Zikai
    Zhang, Hongjuan
    Dong, Anxue
    MULTIMEDIA SYSTEMS, 2025, 31 (03)
  • [27] Large-scale multi-view subspace clustering with latent centroid anchor guidanceLarge-scale multi-view subspace clustering with latent centroid anchor guidanceC. Han et al.
    Chengming Han
    Zikai Wu
    Hongjuan Zhang
    Anxue Dong
    Multimedia Systems, 2025, 31 (3)
  • [28] Center consistency guided multi-view embedding anchor learning for large-scale graph clustering
    Zhang, Xinyue
    Ren, Zhenwen
    Yang, Chao
    KNOWLEDGE-BASED SYSTEMS, 2023, 260
  • [29] Correntropy-Induced Tensor Learning for Multi-view Subspace Clustering
    Chen, Yongyong
    Wang, Shuqin
    Su, Jingyong
    Chen, Junxin
    2022 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2022, : 897 - 902
  • [30] One-step Tensor Learning for Multi-view Subspace Clustering
    Zhao X.-J.
    Xu T.-T.
    Chen Y.-Y.
    Xu Y.
    Zidonghua Xuebao/Acta Automatica Sinica, 2023, 49 (01): : 40 - 53