A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction.
Ferdinand BollweinStephan WestphalPublished in: Appl. Intell. (2021)
Keyphrases
- branch bound
- dynamic programming
- decision tree induction
- optimal solution
- learning algorithm
- preprocessing
- computational complexity
- objective function
- np hard
- linear programming
- classification algorithm
- exhaustive search
- lower and upper bounds
- decision trees
- association rules
- image segmentation
- probabilistic model
- simulated annealing
- particle swarm optimization
- optimization algorithm
- global optimization
- genetic algorithm