Top-down decision tree learning as information based boosting
From MaRDI portal
Publication:1870539
DOI10.1016/S0304-3975(02)00181-0zbMath1026.68120MaRDI QIDQ1870539
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the boosting ability of top-down decision tree learning algorithms
- A decision-theoretic generalization of on-line learning and an application to boosting
- Boosting using branching programs
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Boosting a weak learning algorithm by majority
- Improved boosting algorithms using confidence-rated predictions
- Probably Approximate Learning of Sets and Functions