Sparse subspace clustering for data with missing entries and high-rank matrix completion
DOI10.1016/J.NEUNET.2017.04.005zbMATH Open1429.68214OpenAlexW2609983914WikidataQ36377806 ScholiaQ36377806MaRDI QIDQ2292193FDOQ2292193
Authors: Jicong Fan, Tommy W. S. Chow 
Publication date: 3 February 2020
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2017.04.005
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Principal component analysis.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Pattern recognition and machine learning.
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Probabilistic Principal Component Analysis
- Multiview Matrix Completion for Multilabel Image Classification
- A survey on enhanced subspace clustering
- Clustering: a neural network approach
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Hybrid linear modeling via local best-fit flats
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Fault detection and diagnosis of non-linear non-Gaussian dynamic processes using kernel dynamic independent component analysis
- Kernel PCA for novelty detection
- Learning Markov random walks for robust subspace clustering and estimation
- Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
- 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
Uses Software
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)
