A robust boosting algorithm

DOI10.1007/3-540-36755-1_27MaRDI QIDQ4709214zbMATH OpenFDO

Authors Richard Nock, Patrice Lefaucheur

Publication date 20 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2430/24300319.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Boosting in the presence of noise
• Averaged boosting: A noise-robust ensemble method
• An empirical comparison of three boosting algorithms on real data sets with artificial class noise
• A consistent strategy for boosting algorithms
• Learning Theory and Kernel Machines

Cited in

(17)

• A local boosting algorithm for solving classification problems
• A simple boosting algorithm using multi-way branching decision trees
• On domain-partitioning induction criteria: worst-case bounds for the worst-case based
• Robust algorithms via PAC-Bayes and Laplace distributions
• Boosting. Foundations and algorithms.
• A consistent strategy for boosting algorithms
• A Hybrid Approach of Boosting Against Noisy Data
• Averaged boosting: A noise-robust ensemble method
• An empirical comparison of three boosting algorithms on real data sets with artificial class noise
• Wrapping boosters against noise
• A noise-detection based AdaBoost algorithm for mislabeled data
• A ROBUST BOOSTING METHOD FOR MISLABELED DATA
• Boosting in the presence of outliers: adaptive classification with nonconvex loss functions
• Learning Theory
• Computational Science - ICCS 2004
• Boosting in the presence of noise
• An adaptive version of the boost by majority algorithm

This page was built for publication: A robust boosting algorithm

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