An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX
Dima GrigorievMarek KarpinskiAndrew Chi-Chih YaoPublished in: Electron. Colloquium Comput. Complex. (1995)
Keyphrases
- lower bound
- decision trees
- upper bound
- branch and bound algorithm
- exponential size
- branch and bound
- predictive accuracy
- training data
- objective function
- decision tree induction
- worst case
- decision rules
- computational complexity
- constant factor
- average case complexity
- naive bayes
- classification rules
- machine learning
- random forest
- integer programming
- vc dimension
- upper and lower bounds