Optimization-based feature selection with adaptive instance sampling
From MaRDI portal
Publication:2499140
DOI10.1016/j.cor.2005.01.021zbMath1113.90139OpenAlexW2042855117MaRDI QIDQ2499140
Jaekyung Yang, Sigurdur Ólafsson
Publication date: 14 August 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.021
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains ⋮ Improved feature selection with simulation optimization ⋮ Operations research and data mining ⋮ Synergies of operations research and data mining ⋮ A discrete particle swarm optimization method for feature selection in binary classification problems ⋮ The impact of preprocessing on data mining: an evaluation of classifier sensitivity in direct marketing
Uses Software
Cites Work
- Wrappers for feature subset selection
- Learning Boolean concepts in the presence of many irrelevant features
- Two-stage nested partitions method for stochastic optimization
- Adaptive sampling methods for scaling up knowledge discovery algorithms
- Nested Partitions Method for Global Optimization
- Mathematical Programming for Data Mining: Formulations and Challenges
- Unnamed Item
This page was built for publication: Optimization-based feature selection with adaptive instance sampling
