Column subset selection via sparse approximation of SVD

DOI10.1016/J.TCS.2011.11.019zbMATH Open1238.65030OpenAlexW2062570725MaRDI QIDQ764372FDOQ764372

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

Recommendations

• Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
• An improved approximation algorithm for the column subset selection problem
• Faster subset selection for matrices and applications
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• Optimal column-based low-rank matrix reconstruction

zbMATH Keywords

sparse approximationgreedy algorithmpolynomial-time algorithmsubset selectionsingular value decomposition (SVD)

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Rang revealing QR factorizations
• Title not available (Why is that?)
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Relative-Error $CUR$ Matrix Decompositions
• Fast monte-carlo algorithms for finding low-rank approximations
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Greed is Good: Algorithmic Results for Sparse Approximation
• Adaptive greedy approximations
• Sparse Approximate Solutions to Linear Systems
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Smoothed analysis of algorithms
• Random vectors in the isotropic position
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• On Rank-Revealing Factorisations
• Low‐rank revealing QR factorizations
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Numerical Linear Algebra
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Sampling from large matrices
• Subset selection for matrices
• Title not available (Why is that?)
• Fast computation of low rank matrix approximations
• Vector greedy algorithms
• Title not available (Why is that?)
• Sampling-based dimension reduction for subspace approximation
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Title not available (Why is that?)
• Bounds on singular values revealed by QR factorizations
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• Title not available (Why is that?)

Cited In (12)

• Title not available (Why is that?)
• Column subset selection problem is UG-hard
• Optimal column subset selection for image classification by genetic algorithms
• Title not available (Why is that?)
• On the accuracy of cross and column low-rank maxvol approximations in average
• Empirical column selection method in the simplex method
• Regularized greedy column subset selection
• A training set subsampling strategy for the reduced basis method
• Literature survey on low rank approximation of matrices
• Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
• Title not available (Why is that?)
• Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD

Uses Software

• svdpack

This page was built for publication: Column subset selection via sparse approximation of SVD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764372)