Boosting with Noisy Data: Some Views from Statistical Theory

DOI10.1162/089976604322860703MaRDI QIDQ4819816zbMATH OpenOpenAlexFDO

Authors Wenxin Jiang

Publication date 5 October 2004

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976604322860703

zbMATH Keywords

AdaBoost

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Soft margins for AdaBoost
• Noise peeling methods to improve boosting algorithms
• Boosting in the presence of noise
• A noise-detection based AdaBoost algorithm for mislabeled data
• A boosting approach to remove class label noise1

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)
• Analyzing bagging
• Arcing classifiers. (With discussion)
• Boosting a weak learning algorithm by majority
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Greedy function approximation: A gradient boosting machine.
• Matching pursuits with time-frequency dictionaries
• Minimax nonparametric classification .I. Rates of convergence
• On the existence of linear weak learners and applications to boosting
• Stochastic gradient boosting.

Cited in

(5)

• Soft margins for AdaBoost
• A Hybrid Approach of Boosting Against Noisy Data
• scientific article; zbMATH DE number 1977841 (Why is no real title available?)
• scientific article; zbMATH DE number 1881083 (Why is no real title available?)
• A stochastic approximation view of boosting

This page was built for publication: Boosting with Noisy Data: Some Views from Statistical Theory

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