Column subset selection via sparse approximation of SVD
From MaRDI portal
Publication:764372
DOI10.1016/j.tcs.2011.11.019zbMath1238.65030OpenAlexW2062570725MaRDI QIDQ764372
Ali Çivril, Malik Magdon-Ismail
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.019
greedy algorithmsubset selectionpolynomial-time algorithmsparse approximationsingular value decomposition (SVD)
Related Items
Optimal column subset selection for image classification by genetic algorithms, Column subset selection problem is UG-hard, A training set subsampling strategy for the reduced basis method, Unnamed Item, Literature survey on low rank approximation of matrices, Regularized greedy column subset selection, On the accuracy of cross and column low-rank maxvol approximations in average
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rang revealing QR factorizations
- Vector greedy algorithms
- Subset selection for matrices
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Random vectors in the isotropic position
- Bounds on singular values revealed by QR factorizations
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Sampling from large matrices
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sampling-based dimension reduction for subspace approximation
- Smoothed analysis of algorithms
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Relative-Error $CUR$ Matrix Decompositions
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- On Rank-Revealing Factorisations
- Low‐rank revealing QR factorizations
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Sparse Approximate Solutions to Linear Systems
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast computation of low rank matrix approximations
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Numerical Linear Algebra
- Adaptive greedy approximations
