Two step semi-optimal branch and bound algorithm for feature selection in mixed variable discrimination.
Ewa KrusinskaPublished in: Pattern Recognit. (1989)
Keyphrases
- branch and bound algorithm
- feature selection
- optimal solution
- lower bound
- variable ordering
- branch and bound
- upper bound
- lower bounding
- test problems
- np hard
- search tree
- feature subset
- randomly generated problems
- precedence constraints
- combinatorial optimization
- worst case
- branch and bound method
- multi step
- mixed integer linear programming
- lagrangian relaxation
- max sat
- single machine scheduling problem
- strongly np hard
- upper bounding
- particle swarm optimization
- linear programming
- search space
- feature space
- objective function
- asymptotically optimal
- maximum clique