Blossom: an Anytime Algorithm for Computing Optimal Decision Trees.
Emir DemirovicEmmanuel HebrardLouis JeanPublished in: ICML (2023)
Keyphrases
- optimal solution
- objective function
- cost function
- decision trees
- experimental evaluation
- dynamic programming
- optimization algorithm
- computational cost
- computational complexity
- preprocessing
- detection algorithm
- high accuracy
- classification algorithm
- np hard
- times faster
- decision tree algorithm
- learning algorithm
- neural network
- exhaustive search
- globally optimal
- optimality criterion
- computationally efficient
- linear programming
- worst case
- k means
- search algorithm
- bayesian networks
- simulated annealing
- matching algorithm
- closed form
- optimal strategy
- optimal parameters
- image segmentation
- data sets
- operating point