Improved bounds for the randomized decision tree complexity of recursive majority.
Frédéric MagniezAshwin NayakMiklos SanthaDavid XiaoPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- decision trees
- worst case
- decision forest
- logistic regression
- lower bound
- recursive algorithm
- improved algorithm
- complexity bounds
- random forest
- predictive accuracy
- upper bound
- decision rules
- naive bayes
- machine learning
- lower and upper bounds
- upper and lower bounds
- average case
- classification trees
- decision tree induction
- tree construction
- classification accuracy
- decision tree learning
- active learning
- randomized algorithms
- decision tree learning algorithm