A branch & bound algorithm to determine optimal cross-splits for decision tree induction.
Ferdinand BollweinMartin DahmenStephan WestphalPublished in: Ann. Math. Artif. Intell. (2020)
Keyphrases
- decision tree induction
- branch bound
- optimal solution
- dynamic programming
- preprocessing
- learning algorithm
- computational complexity
- np hard
- particle swarm optimization algorithm
- exhaustive search
- neural network
- data sets
- objective function
- particle swarm optimization
- convergence rate
- decision trees
- search algorithm
- linear programming