Sign in
Improved bounds for the randomized decision tree Complexity of recursive majority.
Frédéric Magniez
Ashwin Nayak
Miklos Santha
Jonah Sherman
Gábor Tardos
David Xiao
Published in:
Random Struct. Algorithms (2016)
Keyphrases
</>
decision trees
worst case
upper bound
decision tree learning
upper and lower bounds
decision tree induction
error tolerance
training data
naive bayes
randomized algorithms
decision forest
decision tree algorithm
logistic regression
data sets
np hard
computational complexity
machine learning