Sparse subspace clustering for data with missing entries and high-rank matrix completion
From MaRDI portal
(Redirected from Publication:2292193)
Recommendations
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- A rank-constrained matrix representation for hypergraph-based subspace clustering
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
- A subspace-approximating algorithm for matrix completion
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A survey on enhanced subspace clustering
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Clustering: a neural network approach
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
- Exact matrix completion via convex optimization
- Fault detection and diagnosis of non-linear non-Gaussian dynamic processes using kernel dynamic independent component analysis
- Hybrid linear modeling via local best-fit flats
- Kernel PCA for novelty detection
- Learning Markov random walks for robust subspace clustering and estimation
- Multiview Matrix Completion for Multilabel Image Classification
- Pattern recognition and machine learning.
- Principal component analysis.
- Probabilistic Principal Component Analysis
- Robust principal component analysis?
- Subspace segmentation by dense block and sparse representation
Cited in
(5)- A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
- Clustering with missing and left‐censored data: A simulation study comparing multiple‐imputation‐based procedures
- Robust non-negative sparse graph for semi-supervised multi-label learning with missing labels
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
This page was built for publication: Sparse subspace clustering for data with missing entries and high-rank matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292193)
