Robust Kernelized Multiview Self-Representation for Subspace Clustering

被引:75
作者
Xie, Yuan [1 ]
Liu, Jinyan [2 ]
Qu, Yanyun [2 ]
Tao, Dacheng [3 ]
Zhang, Wensheng [4 ]
Dai, Longquan [5 ]
Ma, Lizhuang [1 ]
机构
[1] East China Normal Univ, Sch Comp Sci & Technol, Shanghai 200062, Peoples R China
[2] Xiamen Univ, Sch Informat Sci & Technol, Xiamen 361005, Peoples R China
[3] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia
[4] Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
[5] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensile stress; Kernel; Manifolds; Optimization; Learning systems; Correlation; Data models; Kernelization; multiview subspace learning; nonlinear subspace clustering; tensor singular value decomposition (t-SVD); REGULARIZATION; RECOGNITION; FRAMEWORK;
D O I
10.1109/TNNLS.2020.2979685
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this article, we propose a multiview self-representation model for nonlinear subspaces clustering. By assuming that the heterogeneous features lie within the union of multiple linear subspaces, the recent multiview subspace learning methods aim to capture the complementary and consensus from multiple views to boost the performance. However, in real-world applications, data feature usually resides in multiple nonlinear subspaces, leading to undesirable results. To this end, we propose a kernelized version of tensor-based multiview subspace clustering, which is referred to as Kt-SVD-MSC, to jointly learn self-representation coefficients in mapped high-dimensional spaces and multiple views correlation in unified tensor space. In view-specific feature space, a kernel-induced mapping is introduced for each view to ensure the separability of self-representation coefficients. In unified tensor space, a new kind of tensor low-rank regularizer is employed on the rotated self-representation coefficient tensor to preserve the global consistency across different views. We also derive an algorithm to efficiently solve the optimization problem with all the subproblems having closed-form solutions. Furthermore, by incorporating the nonnegative and sparsity constraints, the proposed method can be easily extended to a useful variant, meaning that several useful variants can be easily constructed in a similar way. Extensive experiments of the proposed method are tested on eight challenging data sets, in which a significant (even a breakthrough) advance over state-of-the-art multiview clustering is achieved.
引用
收藏
页码:868 / 881
页数:14
相关论文
共 64 条
[1]  
[Anonymous], 2015, P IEEE INT C COMP VI
[2]  
[Anonymous], 2006, P ADV NEUR INF PROC
[3]  
[Anonymous], 2008, VLFeat: An open and portable library of computer vision algorithms
[4]  
[Anonymous], ARXIV13045634
[5]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[6]   Correlational spectral clustering [J].
Blaschko, Matthew B. ;
Lampert, Christoph H. .
2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12, 2008, :93-+
[7]  
Bosch A, 2007, IEEE I CONF COMP VIS, P1863
[8]  
Burden R. L., 2011, NUMERICAL ANAL, V9
[9]   Graph Regularized Nonnegative Matrix Factorization for Data Representation [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1548-1560
[10]   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