Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*
From MaRDI portal
Publication:5867685
DOI10.1088/1361-6420/ac8ac5OpenAlexW4293067485WikidataQ114096855 ScholiaQ114096855MaRDI QIDQ5867685
Mingqing Xiao, Wen Li, Ming-Hui Li
Publication date: 14 September 2022
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/ac8ac5
low-rank tensorhyper-Laplaciantensor nuclear normmulti-view subspace clusteringtensor singular value
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Factorization strategies for third-order tensors
- The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
- On unifying multi-view self-representations for clustering by tensor multi-rank minimization
- A nonconvex model with minimax concave penalty for image restoration
- Nonsmooth analysis of singular values. I: Theory
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- First-Order Methods in Optimization
- Convex Sparse Spectral Clustering: Single-View to Multi-View
- Multiview Clustering of Images with Tensor Rank Minimization via Nonconvex Approach
- Essential Tensor Learning for Multi-View Spectral Clustering
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Nonlocal robust tensor recovery with nonconvex regularization *
This page was built for publication: Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*