A \(\mathbb R\)eal generalization of discrete AdaBoost

DOI10.1016/j.artint.2006.10.014zbMath1168.68486OpenAlexW2116041589MaRDI QIDQ1028894

Richard Nock, Frank Nielsen

Publication date: 9 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.10.014

zbMATH Keywords

AdaBoostboostingensemble learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

A novel margin based algorithm for feature extraction ⋮ Fuzzy OWL-Boost: learning fuzzy concept inclusions via real-valued boosting

Uses Software

• UCI-ml
• AdaBoost.MH
• AdaCost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Predictive learning via rule ensembles
• Decision rule, based on the distance, for the classification problem
• A decision-theoretic generalization of on-line learning and an application to boosting
• 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)
• On domain-partitioning induction criteria: worst-case bounds for the worst-case based
• Improved boosting algorithms using confidence-rated predictions
• A theory of the learnable
• Cryptographic limitations on learning Boolean formulae and finite automata

This page was built for publication: A \(\mathbb R\)eal generalization of discrete AdaBoost