A Bidirectional Greedy Heuristic for the Subspace Selection Problem

DOI10.1007/978-3-540-74446-7_12MaRDI QIDQ5429297zbMATH OpenOpenAlexFDO

Authors Dag Haugland

Publication date 29 November 2007

Published in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74446-7_12

zbMATH Keywords

computational experimentsdimension reductiongreedy methodsSubspace selection

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A greedy algorithm for subspace approximation problem
• Subset selection in sparse matrices
• A Fast Approximation Algorithm for the Subset-sum Problem
• Regularized greedy column subset selection
• Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection

Cited in

(5)

• Variable neighbourhood search: Methods and applications
• Forward and backward least angle regression for nonlinear system identification
• On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
• Backward sequential elimination for sparse vector subset selection
• Variable neighbourhood search: methods and applications

This page was built for publication: A Bidirectional Greedy Heuristic for the Subspace Selection Problem

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