A fast Branch-and-Bound algorithm for U-curve feature selection.
Esmaeil Atashpaz-GargariMarcelo da Silva ReisUlisses M. Braga-NetoJunior BarreraEdward R. DoughertyPublished in: Pattern Recognit. (2018)
Keyphrases
- branch and bound algorithm
- feature selection
- lower bound
- branch and bound
- upper bound
- lower bounding
- test problems
- optimal solution
- combinatorial optimization
- np hard
- search tree
- randomly generated problems
- mixed integer linear programming
- upper bounding
- precedence constraints
- feature space
- lagrangian relaxation
- finding an optimal solution
- branch and bound method
- maximum clique
- integer variables
- single machine scheduling problem
- max sat
- dimensionality reduction
- strongly np hard
- column generation