Sparse subspace clustering with jointly learning representation and affinity matrix
From MaRDI portal
Recommendations
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Subspace learning by \(\ell^0\)-induced sparsity
- A subspace clustering method based on class-wise sparse and low-rank representation
- Nonnegative self-representation with a fixed rank constraint for subspace clustering
Cites work
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- Compressed sensing
- Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
- Enhanced Local Texture Feature Sets for Face Recognition Under Difficult Lighting Conditions
Cited in
(3)- Three-constraints affinity matrix on simultaneous identification of the clustering and cardinality of wireless propagation multipaths
- Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
This page was built for publication: Sparse subspace clustering with jointly learning representation and affinity matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1643239)
