An exponential lower bound on the size of algebraic decision trees for Max.
Dima GrigorievMarek KarpinskiAndrew Chi-Chih YaoPublished in: Comput. Complex. (1998)
Keyphrases
- lower bound
- decision trees
- upper bound
- exponential size
- branch and bound algorithm
- constant factor
- running times
- np hard
- lower and upper bounds
- data streams
- rule induction
- lower bounding
- objective function
- training data
- average case complexity
- data structure
- naive bayes
- branch and bound
- data mining
- predictive accuracy
- base classifiers
- random forest