Top-down decision tree learning as information based boosting
From MaRDI portal
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- Improved boosting algorithms using confidence-rated predictions
- Mutual information gaining algorithm and its relation to PAC-learning algorithm
- On the boosting ability of top-down decision tree learning algorithms
- Probably Approximate Learning of Sets and Functions
Cited in
(6)- On the boosting ability of top-down decision tree learning algorithms
- Making decision trees more accurate by losing information
- Top-down decision tree boosting and its applications
- scientific article; zbMATH DE number 1256765 (Why is no real title available?)
- Learning decision trees with stochastic linear classifiers
- Boosting based on divide and merge
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)