by Robert E. Schapire, Yoram Singer
http://www.cse.ucsc.edu/classes/cmps242/Spring00/confidence.boost.ps
Add To MetaCart
Abstract:
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each of their predictions. We give a simplified analysis of AdaBoost in this setting, and we show how this analysis can be used to find improved parameter settings as well as a refined criterion for training weak hypotheses. We give a specific method for assigning confidences to the predictions of decision trees, a method closely related to one used by Quinlan. This method also suggests a technique for growing decision trees which turns out to be identical to one proposed by Kearns and Mansour. We focus next on how to apply the new boosting algorithms to multiclass classification problems, particularly to the multi-label case in which each example may belong to more than one class. We give two boosting methods for this problem, plus a third method based on output coding. One of these leads to a new method for handling the single-label case which is simpler but as effective as techniques suggested by Freund and Schapire. Finally, we give some experimental results comparing a few of the algorithms discussed in this paper.
Citations
|
2138
|
UCI Repository of Machine Learning Databases
– Blake, Merz
- 1998
|
|
1133
|
A decision-theoretic generalization of online learning and an application to boosting
– Freund, Schapire
- 1995
|
|
1004
|
Experiments with a new boosting algorithm
– Schapire
- 1996
|
|
543
|
Additive logistic regression: a statistical view of boosting
– Friedman, Hastie, et al.
|
|
483
|
Boosting the margin: A new explanation for the effectiveness of voting methods
– Schapire, Freund, et al.
- 1998
|
|
337
|
Solving multiclass learning problems via error-correcting output codes
– Dietterich, Bakiri
- 1995
|
|
322
|
Decision theoretic generalization of the PAC model for neural net and other learning applications
– Haussler
- 1992
|
|
293
|
What size net gives valid generalization
– Baum, Haussler
- 1989
|
|
232
|
Bagging, boosting and C4.5
– Quinlan
- 1996
|
|
204
|
An efficient boosting algorithm for combining preferences
– Freund, Iyer, et al.
- 2003
|
|
199
|
Arcing classifiers
– Breiman
- 1998
|
|
129
|
The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network
– Bartlett
- 1998
|
|
111
|
Empirical Support for Winnow and Weighted-Majority Algorithm: Results on a Calendar Scheduling Domain
– Blum
- 1997
|
|
110
|
Practical Methods of Optimization (second edition
– FLETCHER
- 1987
|
|
88
|
Boosting decision trees
– Drucker, Cortes
- 1996
|
|
84
|
An empirical evaluation of bagging and boosting
– Maclin, Opitz
- 1997
|
|
82
|
Pruning adaptive boosting
– Margineantu, Dietterich
- 1997
|
|
75
|
Using output codes to boost multiclass learning problems
– Schapire
- 1997
|
|
67
|
On the boosting ability of top-down decision tree learning algorithms
– Kearns, Mansour
- 1999
|
|
55
|
Using and combining predictors that specialize
– Freund, Schapire, et al.
- 1997
|
|
32
|
A generalization of Sauer's lemma
– Haussler, Long
- 1995
|
|
5
|
Information geometry and alternaning minimization procedures
– Csiszar, Tusnady
- 1984
|
