Adaptively Topological Tensor Network for Multi-View Subspace Clustering

被引:6
|
作者
Liu, Yipeng [1 ]
Chen, Jie [1 ]
Lu, Yingcong [1 ]
Ou, Weiting [1 ]
Long, Zhen [1 ]
Zhu, Ce [1 ]
机构
[1] Univ Elect Sci & Technol China UESTC, Sch Informat & Commun Engn, Chengdu 611731, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensors; Correlation; Clustering algorithms; Image reconstruction; Task analysis; Indexes; Color; Subspace clustering; tensor network architecture; tensor decomposition; low-rank representation; APPROXIMATION; RING; IMAGE;
D O I
10.1109/TKDE.2024.3391627
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view subspace clustering employs learned self-representation from multiple tensor decompositions to exploit the low-rank information. However, the data structures embedded with self-representation tensors may vary in different multi-view datasets. Therefore, a pre-defined decomposition may not fully exploit low-rank information from various data, resulting in sub-optimal multi-view clustering performance. To alleviate this, we proposed the adaptively topological tensor network (ATTN). ATTN can learn a suitable decomposition structure that can represent the low-rank structure and high-order correlation of the self-representation tensors better in a data-driven way, which can capture the intra-view and inter-view information better. Firstly, instead of connecting the tensor network blindly, ATTN utilizes the correlation between adjacent factors to prune redundant connections from the fully connected tensor network, making the tensor network more expressive. Furthermore, a greedy adaptive rank-increasing strategy is applied to optimize the pruned tensor network structure, which improves the capacity of capturing low-rank structure. We apply ATTN on a multi-view subspace clustering task and utilize the alternating direction method of multipliers(ADMM) method to optimize it. Experiments show that multi-view subspace clustering based on ATTN has better performance on nine multi-view datasets.
引用
收藏
页码:5562 / 5575
页数:14
相关论文
共 50 条
  • [1] Multi-view Subspace Clustering on Topological Manifold
    Huang, Shudong
    Wu, Hongjie
    Ren, Yazhou
    Tsang, Ivor W.
    Xu, Zenglin
    Feng, Wentao
    Lv, Jiancheng
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [2] Robust Tensor Subspace Learning for Incomplete Multi-View Clustering
    Liang, Cheng
    Wang, Daoyuan
    Zhang, Huaxiang
    Zhang, Shichao
    Guo, Fei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) : 6934 - 6948
  • [3] Adaptive Tensor Rank Approximation for Multi-View Subspace Clustering
    SUN Xiaoli
    HAI Yang
    ZHANG Xiujun
    XU Chen
    Chinese Journal of Electronics, 2023, 32 (04) : 840 - 853
  • [4] Multi-View Robust Tensor-Based Subspace Clustering
    Al-Sharoa, Esraa M.
    Al-Wardat, Mohammad A.
    IEEE ACCESS, 2022, 10 : 134292 - 134306
  • [5] Nonconvex Tensor Hypergraph Learning for Multi-view Subspace Clustering
    Yao, Xue
    Li, Min
    PATTERN RECOGNITION AND COMPUTER VISION, PRCV 2023, PT IV, 2024, 14428 : 39 - 51
  • [6] Adaptive Tensor Rank Approximation for Multi-View Subspace Clustering
    Sun Xiaoli
    Hai Yang
    Zhang Xiujun
    Xu Chen
    CHINESE JOURNAL OF ELECTRONICS, 2023, 32 (04) : 840 - 853
  • [7] Multi-View Subspace Clustering
    Gao, Hongchang
    Nie, Feiping
    Li, Xuelong
    Huang, Heng
    2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 4238 - 4246
  • [8] Complementary and Consistent Multi-View Subspace Clustering Network
    He S.
    Zhang Y.
    Tang Q.
    Zhang, Yulong, 1600, Xi'an Jiaotong University (55): : 166 - 178
  • [9] 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
  • [10] 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