A more efficient branch and bound algorithm for feature selection.
Bin YuBaozong YuanPublished in: Pattern Recognit. (1993)
Keyphrases
- branch and bound algorithm
- feature selection
- lower bound
- branch and bound
- optimal solution
- upper bound
- np hard
- test problems
- single machine scheduling problem
- lower bounding
- upper bounding
- lagrangian relaxation
- max sat
- mixed integer linear programming
- dimensionality reduction
- computationally expensive
- combinatorial optimization
- neural network
- bayesian networks
- finding an optimal solution