Enhanced intra-inter view correlation learning for multi-view subspace clustering

被引:1
作者
Zhang, Tao [1 ]
Zhang, Huanhuan [1 ]
Zhao, Yu [1 ]
Liu, Fan [2 ]
机构
[1] Yangzhou Univ, Sch Informat Engn, Yangzhou, Peoples R China
[2] Hohai Univ, Coll Comp & Informat, Nanjing, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
multi-view clustering; intra-inter view; tensor nuclear norm; hypergraph; Hilbert-Schmidt independence criterion; LOW-RANK; ROBUST; SCALE;
D O I
10.1117/1.JEI.32.5.053035
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multi-view subspace clustering has attracted widespread attention for its superior clustering effectiveness. However, most of the current methods do not fully exploit the intra-view (sample-to-sample) and inter-view (view-to-view) information among multi-view data. Focusing on this problem, we propose a method called enhanced intra-inter view correlation learning for multi-view subspace clustering (EIVCL). EIVCL simultaneously considers the intra-view and inter-view correlations and introduces two constraint terms for each aspect to capture the data structure information. Specifically, in the intra-view space, we apply the tensor-singular value decomposition (t-SVD)-based tensor nuclear norm (TNN) on the tensor formed by stacking self-representative coefficient matrices for obtaining the high-order correlation information between samples in the specific view. Moreover, we introduce a hypergraph-induced Laplace regularization term to preserve the local geometric structure within views. In the inter-view space, we impose the t-SVD-based TNN on the rotated tensor to obtain the multiple views correlation. Furthermore, we utilize the kernel dependence metric, namely Hilbert-Schmidt independence criterion, to capture the high-order non-linear relationships between views. In addition, all above strategies are integrated into a unified clustering framework, which is solved by our proposed optimization algorithm based on the alternating direction method of multipliers. Extensive experiments on six benchmark datasets demonstrate that EIVCL outperforms several state-of-the-art multi-view algorithms.
引用
收藏
页数:22
相关论文
共 50 条
[41]   On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank Minimization [J].
Xie, Yuan ;
Tao, Dacheng ;
Zhang, Wensheng ;
Liu, Yan ;
Zhang, Lei ;
Qu, Yanyun .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2018, 126 (11) :1157-1179
[42]   Correntropy-Based Multiview Subspace Clustering [J].
Xing, Lei ;
Chen, Badong ;
Du, Shaoyi ;
Gu, Yuantao ;
Zheng, Nanning .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (06) :3298-3311
[43]   Laplacian Regularized Low-Rank Representation and Its Applications [J].
Yin, Ming ;
Gao, Junbin ;
Lin, Zhouchen .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2016, 38 (03) :504-517
[44]   Multiview Consensus Graph Clustering [J].
Zhan, Kun ;
Nie, Feiping ;
Wang, Jing ;
Yang, Yi .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2019, 28 (03) :1261-1270
[45]  
Zhang C., 2022, J. Electron. Imaging., V22
[46]   Latent Multi-view Subspace Clustering [J].
Zhang, Changqing ;
Hu, Qinghua ;
Fu, Huazhu ;
Zhu, Pengfei ;
Cao, Xiaochun .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :4333-4341
[47]   Low-Rank Tensor Constrained Multiview Subspace Clustering [J].
Zhang, Changqing ;
Fu, Huazhu ;
Liu, Si ;
Liu, Guangcan ;
Cao, Xiaochun .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :1582-1590
[48]   Clean affinity matrix learning with rank equality constraint for multi-view subspace clustering [J].
Zhao, Jinbiao ;
Lu, Gui-Fu .
PATTERN RECOGNITION, 2022, 134
[49]   Tensor Low-Rank Representation for Data Recovery and Clustering [J].
Zhou, Pan ;
Lu, Canyi ;
Feng, Jiashi ;
Lin, Zhouchen ;
Yan, Shuicheng .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2021, 43 (05) :1718-1732
[50]   Inclusivity induced adaptive graph learning for multi-view clustering [J].
Zou, Xin ;
Tang, Chang ;
Zheng, Xiao ;
Sun, Kun ;
Zhang, Wei ;
Ding, Deqiong .
KNOWLEDGE-BASED SYSTEMS, 2023, 267