On the boosting ability of top-down decision tree learning algorithms

DOI10.1006/jcss.1997.1543zbMath0938.68083OpenAlexW1967684610MaRDI QIDQ1305926

Michael Kearns, Yishay Mansour

Publication date: 5 June 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1543

zbMATH Keywords

decision tree learningtop-down algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

On domain-partitioning induction criteria: worst-case bounds for the worst-case based ⋮ Large Scale Prediction with Decision Trees ⋮ FE-CIDIM: fast ensemble of CIDIM classifiers ⋮ Effect of pruning and early stopping on performance of a boosting ensemble. ⋮ Diversity of ability and cognitive style for group decision processes ⋮ Boosting in the presence of noise ⋮ Top-down decision tree learning as information based boosting

Uses Software

• AdaBoost.MH
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient distribution-free learning of probabilistic concepts
• Boosting a weak learning algorithm by majority
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• A theory of the learnable
• Cryptographic limitations on learning Boolean formulae and finite automata

This page was built for publication: On the boosting ability of top-down decision tree learning algorithms