Robust subspace clustering
From MaRDI portal
Publication:2249846
Abstract: Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) [In IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2009) 2790-2797] to cluster noisy data, and develops some novel theory demonstrating its correctness. In particular, the theory uses ideas from geometric functional analysis to show that the algorithm can accurately recover the underlying subspaces under minimal requirements on their orientation, and on the number of samples per subspace. Synthetic as well as real data experiments complement our theoretical study, illustrating our approach and demonstrating its effectiveness.
Recommendations
Cites work
- \(\ell_{1}\)-penalization for mixture regression models
- \(k\)-plane clustering
- A geometric analysis of subspace clustering with outliers
- Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
- Computing a nonnegative matrix factorization -- provably
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Graph selection with GGMselect
- High-dimensional graphs and variable selection with the Lasso
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- Hybrid linear modeling via local best-fit flats
- Hybrid Systems: Computation and Control
- Identification of switched linear systems via sparse optimization
- Improved matrix uncertainty selector
- Nearest \(q\)-flat to \(m\) points
- Probabilistic Principal Component Analysis
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
- Robust subspace clustering
- Scaled sparse linear regression
- Sparse recovery under matrix uncertainty
- Spectral algorithms
- Spectral clustering based on local linear approximations
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Subspace clustering of high-dimensional data: a predictive approach
- Templates for convex cone problems with applications to sparse signal recovery
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The LASSO Risk for Gaussian Matrices
Cited in
(54)- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
- A rank-constrained matrix representation for hypergraph-based subspace clustering
- Multi-manifold LLE learning in pattern recognition
- Subspace clustering with automatic feature grouping
- Iterative subsampling in solution path clustering of noisy big data
- A geometric analysis of subspace clustering with outliers
- Side-information-induced reweighted sparse subspace clustering
- The hierarchy of block models
- Three-constraints affinity matrix on simultaneous identification of the clustering and cardinality of wireless propagation multipaths
- Subgroup-effects models for the analysis of personal treatment effects
- Subspace learning by \(\ell^0\)-induced sparsity
- Lossy compression approach to subspace clustering
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- Robust subspace clustering
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- The shape of data and probability measures
- Synchrosqueezed wave packet transforms and diffeomorphism based spectral analysis for 1D general mode decompositions
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Kernel truncated regression representation for robust subspace clustering
- Block diagonal representation learning for robust subspace clustering
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Noisy sparse subspace clustering
- A robust subspace clustering algorithm
- Greedy feature selection for subspace clustering
- Robust Subspace Clustering via Thresholding
- Robust matrix root-clustering analysis in a union of ω-subregions
- Robust classifier using distance-based representation with square weights
- Compressive classification: where wireless communications meets machine learning
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- scientific article; zbMATH DE number 1966562 (Why is no real title available?)
- How to Round Subspaces: A New Spectral Clustering Algorithm
- Dimensionality-reduced subspace clustering
- Robust discriminative clustering with sparse regularizers
- l_p-recovery of the most significant subspace among multiple subspaces with outliers
- scientific article; zbMATH DE number 7255037 (Why is no real title available?)
- Subspace clustering through sub-clusters
- Subspace clustering using ensembles of \(K\)-subspaces
- A general theory for subspace-sparse recovery
- scientific article; zbMATH DE number 7626708 (Why is no real title available?)
- Reconstruction model and fast algorithm for subspace clustering
- scientific article; zbMATH DE number 7156497 (Why is no real title available?)
- Learning by unsupervised nonlinear diffusion
- Compact dictionary pair learning and refining based on principal components analysis
- Filtrated algebraic subspace clustering
- Local subspace clustering
- Robust Subspace Discovery via Relaxed Rank Minimization
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Spectral clustering with robust self-learning constraints
- Unsupervised robust discriminative subspace representation based on discriminative approximate isometric embedding
- Statistical insights into deep neural network learning in subspace classification
- Sparse subspace clustering in diverse multiplex network model
- Learning a mixture of two subspaces over finite fields
- A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces
This page was built for publication: Robust subspace clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249846)
