The quality of tree approximation from AUC bounds.
Navid Tafaghodi KhajaviAnthony KuhPublished in: ITA (2016)
Keyphrases
- error bounds
- upper bound
- decision trees
- high quality
- lower bound
- feature selection
- approximation algorithms
- error tolerance
- approximation methods
- stage stochastic programs
- closed form
- tree structure
- error rate
- index structure
- worst case
- np hard
- probability estimation
- special case
- xml documents
- sufficient statistics
- training set