Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority.
Frédéric MagniezAshwin NayakMiklos SanthaDavid XiaoPublished in: ICALP (1) (2011)
Keyphrases
- decision trees
- worst case
- lower bound
- upper bound
- decision forest
- decision tree classifiers
- randomized algorithms
- naive bayes
- neural network
- logistic regression
- predictive accuracy
- machine learning algorithms
- tree construction
- lower and upper bounds
- random forest
- computational cost
- computational complexity
- data mining