A Bidirectional Greedy Heuristic for the Subspace Selection Problem

DOI10.1007/978-3-540-74446-7_12zbMath1134.68496OpenAlexW1562356535MaRDI QIDQ5429297

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

dimension reductioncomputational experimentsgreedy methodsSubspace selection

Mathematics Subject Classification ID

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

Related Items (3)

Forward and backward least angle regression for nonlinear system identification ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications

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