Boosting with Noisy Data: Some Views from Statistical Theory
From MaRDI portal
Publication:4819816
DOI10.1162/089976604322860703zbMath1097.68593OpenAlexW2110190278MaRDI QIDQ4819816
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
Cites Work
- Greedy function approximation: A gradient boosting machine.
- A decision-theoretic generalization of on-line learning and an application to boosting
- Arcing classifiers. (With discussion)
- 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)
- Analyzing bagging
- Boosting a weak learning algorithm by majority
- Minimax nonparametric classification .I. Rates of convergence
- Matching pursuits with time-frequency dictionaries
- Stochastic gradient boosting.
- On the existence of linear weak learners and applications to boosting