Boosting methods for regression

Machine Learning

Volumn 47, Issue 2-3, 2002, Pages 153-200

  Duffy, Nigel ^a   Helmbold, David ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Arcing; Boosting; Ensemble methods; Gradient descent; Learning; Regression

Indexed keywords

ERROR ANALYSIS; ITERATIVE METHODS; LEARNING ALGORITHMS; REGRESSION ANALYSIS;

GRADIENT DESCENT LEVERAGING ALGORITHMS;

LEARNING SYSTEMS;

EID: 0036568038     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013685603443     Document Type: Article

References (33)

1. Universal approximation bounds for superposition of a sigmoidal function
2. An empirical comparison of voting classification algorithms: Bagging, boosting and variants
3. A boosting algorithm for regression
4. Bagging predictors
5. Arcing classifiers
6. Prediction games and arcing algorithms
7. Potential boosters?
8. A geometric approach to leveraging weak learners
9. Boosting a weak learning algorithm by majority
10. An adaptive version of the boost by majority algorithm
11. Experiments with a new Boosting algorithm
12. A decision-theoretic generalization of on-line learning and an application to boosting
13. Additive logistic regression: A statistical view of boosting
14. Improving regressors using boosting techniques
15. A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
16. Cryptographic limitations on learning boolean formulae and finite automata
17. On efficient agnostic learning of linear combinations of basis functions
18. Boosting algorithms as gradient descent
19. Bagging, boosting and C4.5
20. Soft margins for AdaBoost'
21. Barrier boosting
22. Boosting methodology for regression pproblems
23. Boosting the margin: A new explanation for the effectiveness of voting methods
24. Improved boosting algorithms using confidence-rated predictions
25. A theory of the learnable