A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
From MaRDI portal
Publication:4619680
Recommendations
- Sparse subspace clustering for data with missing entries and high-rank matrix completion
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
- Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
- An efficient matrix factorization based low-rank representation for subspace clustering
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- A subspace clustering method based on class-wise sparse and low-rank representation
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
Cited in
(2)
This page was built for publication: A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619680)