Lower Bounds for Noisy Boolean Decision Trees.
William S. EvansNicholas PippengerPublished in: STOC (1996)
Keyphrases
- lower bound
- decision trees
- upper bound
- branch and bound algorithm
- lower and upper bounds
- real valued
- predictive accuracy
- decision tree induction
- np hard
- optimal solution
- naive bayes
- branch and bound
- objective function
- decision tree learning
- machine learning algorithms
- worst case
- rule sets
- random forest
- noisy environments
- vc dimension
- boolean functions
- upper and lower bounds
- constructive induction
- decision rules
- search algorithm
- training data
- set of randomly generated instances
- attribute selection
- decision tree algorithm
- optimal cost
- data sets
- linear programming relaxation
- max sat
- data mining methods
- index structure
- special case
- learning algorithm