A Tighter Error Bound for Decision Tree Learning Using PAC Learnability.
Chaithanya PichukaRaju S. BapiChakravarthy BhagvatiArun K. PujariBulusu Lakshmana DeekshatuluPublished in: IJCAI (2007)
Keyphrases
- decision tree learning
- error bounds
- pac learnability
- upper bound
- sample complexity
- worst case
- vc dimension
- theoretical analysis
- decision trees
- lower bound
- constructive induction
- pac learning
- concept class
- attribute values
- meta learning
- ensemble methods
- definite clause
- concept classes
- generalization error
- learning algorithm
- concept learning
- machine learning
- sample size
- learning tasks
- model selection
- domain knowledge
- reinforcement learning
- feature extraction