An efficient matrix factorization based low-rank representation for subspace clustering
From MaRDI portal
Publication:456036
DOI10.1016/J.PATCOG.2012.06.011zbMATH Open1248.68411OpenAlexW1992603145MaRDI QIDQ456036FDOQ456036
Authors: Yuanyuan Liu, Licheng Jiao, Fanhua Shang 
Publication date: 23 October 2012
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2012.06.011
Recommendations
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Latent low-rank representation
matrix tri-factorizationalternating direction method (ADM)low rank representationnuclear norm minimization (NNM)positive semidefinite (PSD)
Cited In (15)
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Learning Markov random walks for robust subspace clustering and estimation
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Learning transformations for clustering and classification
- Nonnegative self-representation with a fixed rank constraint for subspace clustering
- A rank-constrained matrix representation for hypergraph-based subspace clustering
- Latent low-rank representation
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Scalable low-rank representation
- Exemplar-based low-rank matrix decomposition for data clustering
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Subspace clustering by \((k,k)\)-sparse matrix factorization
Uses Software
This page was built for publication: An efficient matrix factorization based 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 Q456036)
