Journal
IEEE ACCESS
Volume 9, Issue -, Pages 118851-118860Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3107673
Keywords
Tensors; Optimization; Minimization methods; Linear programming; Licenses; Signal processing algorithms; Periodic structures; Multi-view subspace clustering; hyper-Laplacian graph; low-rank tensor; weighted tensor nuclear norm
Categories
Funding
- National Natural Science Foundation of China [61866033]
- Natural Science Foundation of Gansu Province, China [18JR3RA369]
- University Scientific Research Project of Gansu Province, China [2017B-83]
- Introduction of Talent Research Project of Northwest Minzu University [xbmuyjrc201904]
- Fundamental Research Funds for the Central Universities of Northwest Minzu University [31920200064, 1920200097]
- Gansu Provincial First-Class Discipline Program of Northwest Minzu University [11080305]
- Leading Talent of National Ethnic Affairs Commission (NEAC)
- Young Talent of NEAC
- Innovative Research Team of NEAC [(2018) 98]
Ask authors/readers for more resources
In this study, a new method WHLR-MSC is introduced for multi-view subspace clustering, which utilizes weighted tensor nuclear norm to accurately capture class discrimination information of sample distribution and hyper-Laplacian graph regularization to capture local geometric structure of data. Extensive experiments demonstrate the effectiveness of the proposed WHLR-MSC method on benchmark image datasets.
In this paper, we present a hyper-Laplacian regularized method WHLR-MSC with a new weighted tensor nuclear norm for multi-view subspace clustering. Specifically, we firstly stack the subspace representation matrices of the different views into a tensor, which neatly captures the higher-order correlations between the different views. Secondly, in order to make all the singular values have different contributions in tensor nuclear norm based on tensor-Singular Value Decomposition (t-SVD), we use weighted tensor nuclear norm to constrain the constructed tensor, which can obtain the class discrimination information of the sample distribution more accurately. Third, from a geometric point of view, the data are usually sampled from a low-dimensional manifold embedded in a high-dimensional ambient space, the WHLR-MSC model uses hyper-Laplacian graph regularization to capture the local geometric structure of the data. An effective algorithm for solving the optimization problem of WHLR-MSC model is proposed. Extensive experiments on five benchmark image datasets show the effectiveness of our proposed WHLR-MSC method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available