Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
From MaRDI portal
Cited in
(7)- Sparse subspace clustering with jointly learning representation and affinity matrix
- Low-rank local tangent space embedding for subspace clustering
- Block diagonal representation learning for robust subspace clustering
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Double structure scaled simplex representation for multi-view subspace clustering
- Self-regularized fixed-rank representation for subspace segmentation
- Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
This page was built for publication: Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613236)