Top-down decision tree learning as information based boosting

DOI10.1016/S0304-3975(02)00181-0MaRDI QIDQ1870539zbMATH OpenFDO

Authors Eiji Takimoto, A. Maruoka

Publication date 14 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(G\)-entropy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 2086341
• scientific article; zbMATH DE number 1256765
• A theory of multiclass boosting
• On the boosting ability of top-down decision tree learning algorithms
• Multi-class AdaBoost

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 2077184 (Why is no real title available?)
• A decision-theoretic generalization of on-line learning and an application to boosting
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Boosting a weak learning algorithm by majority
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Boosting using branching programs
• Improved boosting algorithms using confidence-rated predictions
• On the boosting ability of top-down decision tree learning algorithms
• Probably Approximate Learning of Sets and Functions

Cited in

(4)

• Algorithmic Learning Theory
• scientific article; zbMATH DE number 1629814 (Why is no real title available?)
• Learning decision trees with stochastic linear classifiers
• scientific article; zbMATH DE number 2086341 (Why is no real title available?)

Describes a project that uses

Uses Software

• C4.5
• AdaBoost.MH

This page was built for publication: Top-down decision tree learning as information based boosting

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