scientific article; zbMATH DE number 1256765

zbMATH Open0915.68142MaRDI QIDQ4228501FDOQ4228501

Authors: Michael Kearns, Yishay Mansour 

Publication date: 1 March 1999

Title of this publication is not available (Why is that?)

Recommendations

• On the boosting ability of top-down decision tree learning algorithms
• scientific article; zbMATH DE number 2086341
• Top-down decision tree learning as information based boosting

zbMATH Keywords

learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (15)

• Top-down decision tree learning as information based boosting
• A simple boosting algorithm using multi-way branching decision trees
• Mining evolving data streams for frequent patterns
• Structure and majority classes in decision tree learning
• Boosting using branching programs
• Boosted ARTMAP: modifications to fuzzy ARTMAP motivated by boosting theory
• Regularized impurity reduction: accurate decision trees with complexity guarantees
• Lifelong learning in costly feature spaces
• Learning decision trees with stochastic linear classifiers
• A hybrid filter/wrapper approach of feature selection using information theory
• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparing boosting and bagging for decision trees of rankings
• Algorithmic Learning Theory

Uses Software

• C4.5

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228501)