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 条
[1]  
[Anonymous], 2007, P 19 C NEURAL INFORM, DOI DOI 10.7551/MITPRESS/7503.003.0205
[2]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[3]   High-order manifold regularized multi-view subspace clustering with robust affinity matrices and weighted TNN [J].
Cai, Bing ;
Lu, Gui-Fu ;
Yao, Liang ;
Li, Hua .
PATTERN RECOGNITION, 2023, 134
[4]   Diversity-induced Multi-view Subspace Clustering [J].
Cao, Xiaochun ;
Zhang, Changqing ;
Fu, Huazhu ;
Liu, Si ;
Zhang, Hua .
2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, :586-594
[5]   Robust Multiview Data Analysis Through Collective Low-Rank Subspace [J].
Ding, Zhengming ;
Fu, Yun .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (05) :1986-1997
[6]  
Ding ZM, 2016, AAAI CONF ARTIF INTE, P1181
[7]   Robust and optimal neighborhood graph learning for multi-view clustering [J].
Du, Yangfan ;
Lu, Gui-Fu ;
Ji, Guangyan .
INFORMATION SCIENCES, 2023, 631 (429-448) :429-448
[8]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[9]   Multi-View Subspace Clustering [J].
Gao, Hongchang ;
Nie, Feiping ;
Li, Xuelong ;
Huang, Heng .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :4238-4246
[10]  
Greene D., 2006, P INT C MACH LEARN, P377, DOI DOI 10.1145/1143844.1143892