Robust Kernelized Multiview Self-Representation for Subspace Clustering

被引:70
|
作者
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
相关论文
共 50 条
  • [31] Robust Subspace Clustering via Latent Smooth Representation Clustering
    Xiao, Xiaobo
    Wei, Lai
    NEURAL PROCESSING LETTERS, 2020, 52 (02) : 1317 - 1337
  • [32] Robust Multiview Subspace Clustering of Images via Tighter Rank Approximation
    Sun, Xiaoli
    Wang, Youjuan
    Yang, Ming
    Zhang, Xiujun
    IEEE ACCESS, 2021, 9 : 81173 - 81188
  • [33] Kernelized Multiview Projection for Robust Action Recognition
    Shao, Ling
    Liu, Li
    Yu, Mengyang
    INTERNATIONAL JOURNAL OF COMPUTER VISION, 2016, 118 (02) : 115 - 129
  • [34] Kernelized Multiview Projection for Robust Action Recognition
    Ling Shao
    Li Liu
    Mengyang Yu
    International Journal of Computer Vision, 2016, 118 : 115 - 129
  • [35] Joint self-representation and subspace learning for unsupervised feature selection
    Wang, Ruili
    Zong, Ming
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2018, 21 (06): : 1745 - 1758
  • [36] Joint self-representation and subspace learning for unsupervised feature selection
    Ruili Wang
    Ming Zong
    World Wide Web, 2018, 21 : 1745 - 1758
  • [37] Iterative Multiview Subspace Learning for Unpaired Multiview Clustering
    Yang, Wanqi
    Xin, Like
    Wang, Lei
    Yang, Ming
    Yan, Wenzhu
    Gao, Yang
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (10) : 14848 - 14862
  • [38] Block diagonal representation learning for robust subspace clustering
    Wang, Lijuan
    Huang, Jiawen
    Yin, Ming
    Cai, Ruichu
    Hao, Zhifeng
    INFORMATION SCIENCES, 2020, 526 : 54 - 67
  • [39] Robust latent low rank representation for subspace clustering
    Zhang, Hongyang
    Lin, Zhouchen
    Zhang, Chao
    Gao, Junbin
    NEUROCOMPUTING, 2014, 145 : 369 - 373
  • [40] Projection concept factorization with self-representation for data clustering
    Shao, Chenyu
    Chen, Mulin
    Wang, Qi
    Yuan, Yuan
    NEUROCOMPUTING, 2023, 517 : 62 - 70