CiteSeerX — Improved Boosting Algorithms Using Confidence-rated Predictions

Improved Boosting Algorithms Using Confidence-rated Predictions (1999) [400 citations — 19 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Schapire99improvedboosting,
    author = {Robert E. Schapire and Yoram Singer},
    title = {Improved Boosting Algorithms Using Confidence-rated Predictions},
    booktitle = {Machine Learning},
    year = {1999},
    pages = {80--91}
}

Years of Citing Articles

Bookmarks

OpenURL

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 singl...

Citations

2227	UCI repository of machine learning databases – Blake, Merz
1205	Schapire, “Decision-theoretic generalization of on-line learning and application to boosting – Freund, E - 1997
1045	Experiments with a new boosting algorithm – Freund, Schapire - 1996
596	R.: Additive logistic regression: a statistical view of boosting – Friedman, Hastie, et al. - 1998
500	Boosting the margin: A new explanation for the effectiveness of voting methods – Schapire, Freund, et al. - 1998
341	Solving multiclass learning problems via error-correcting output codes – Dietterich, Bakiri - 1995
302	Decision theoretic generalizations of the PAC model for neural net and other learning applications – Haussler - 1992
281	What size net gives valid generalization – Baum, Haussler - 1989
225	An efficient boosting algorithm for combining preferences – Freund, Iyer, et al. - 1998
222	Bagging, boosting, and C4.5 – Quinlan - 1996
196	arcing classifiers – Breiman, Bias - 1996
130	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
105	Empirical support for winnow and weighted-majority based algorithms: results on a calendar scheduling domain – Blum - 1997
105	Practical Methods of Optimization, Second Edition – Fletcher - 1987
78	Boosting decision trees – Drucker, Cortes - 1996
74	Pruning adaptive boosting – Margineantu, Dietterich - 1997
72	An empirical evaluation of bagging and boosting – Maclin, Opitz - 1997
66	Using output codes to boost multiclass learning problems – Schapire - 1997
64	On the boosting ability of top-down decision tree learning algorithms – Kearns, Mansour - 1996
55	Using and combining predictors that specialize – Freund, Schapire, et al. - 1997
31	A generalization of Sauer’s lemma – Haussler, Long - 1995
4	Information geometry and alternaning minimization procedures – Csiszar, Tusnady - 1984