Backward sequential elimination for sparse vector subset selection

DOI10.1016/S0165-1684(01)00064-0MaRDI QIDQ5958186zbMATH OpenFDO

Authors S. F. Cotter, K. Kreutz-Delgado, B. D. Rao

Publication date 3 March 2002

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0165-1684(01)00064-0

zbMATH Keywords

sparsitysubset selectionsignal representationbackward elimination algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General topics in the theory of algorithms (68W01)

Recommendations

• On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
• Sequential algorithms for observation selection
• Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
• An affine scaling methodology for best basis selection
• A Bidirectional Greedy Heuristic for the Subspace Selection Problem

Cited in

(2)

• Sequential algorithms for observation selection
• Feature subset selection in large dimensionality domains

This page was built for publication: Backward sequential elimination for sparse vector subset selection

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