Robust subspace clustering
From MaRDI portal
Publication:2249846
DOI10.1214/13-AOS1199zbMath1360.62353arXiv1301.2603MaRDI QIDQ2249846
Ehsan Elhamifar, Emmanuel J. Candès, Mahdi Soltanolkotabi
Publication date: 3 July 2014
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.2603
multiple hypothesis testing; spectral clustering; Dantzig selector; Lasso; geometric functional analysis; subspace clustering; \(\ell_{1}\) minimization; nonasymptotic random matrix theory; true and false discoveries
62H99: Multivariate analysis
62H30: Classification and discrimination; cluster analysis (statistical aspects)
Related Items
Dimensionality-reduced subspace clustering, Unnamed Item, Unnamed Item, A general theory for subspace-sparse recovery, Unnamed Item, Compact dictionary pair learning and refining based on principal components analysis, Filtrated Algebraic Subspace Clustering, A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering, Spectral clustering with robust self-learning constraints, Robust classifier using distance-based representation with square weights, \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers, A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces, A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis, Multi-manifold LLE learning in pattern recognition, Subspace clustering with automatic feature grouping, 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, Robust subspace clustering, The shape of data and probability measures, Synchrosqueezed wave packet transforms and diffeomorphism based spectral analysis for 1D general mode decompositions, Kernel truncated regression representation for robust subspace clustering, Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms, Compressive Classification: Where Wireless Communications Meets Machine Learning
Uses Software
Cites Work
- Graph Selection with GGMselect
- Identification of switched linear systems via sparse optimization
- Sparse recovery under matrix uncertainty
- \(\ell_{1}\)-penalization for mixture regression models
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Subspace clustering of high-dimensional data: a predictive approach
- Nearest \(q\)-flat to \(m\) points
- \(k\)-plane clustering
- Templates for convex cone problems with applications to sparse signal recovery
- A geometric analysis of subspace clustering with outliers
- Hybrid linear modeling via local best-fit flats
- Spectral clustering based on local linear approximations
- Robust subspace clustering
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- High-dimensional graphs and variable selection with the Lasso
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Scaled sparse linear regression
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Spectral Algorithms
- Probabilistic Principal Component Analysis
- The LASSO Risk for Gaussian Matrices
- Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- Computing a nonnegative matrix factorization -- provably
- Improved matrix uncertainty selector
- Hybrid Systems: Computation and Control
