Article

Free access

Improved boosting algorithms using confidence-rated predictions

Authors:

Robert E. Schapire,

Yoram SingerAuthors Info & Claims

COLT' 98: Proceedings of the eleventh annual conference on Computational learning theory

Pages 80 - 91

https://doi.org/10.1145/279943.279960

Published: 24 July 1998 Publication History

PDF eReader

References

[1]

Peter L. Bartlett. The sample complexity of pattem classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 1998 (to appeaD.

Digital Library

Google Scholar

[2]

Eric Bauer and Ron Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Unpublished manuscript, 1997.

Google Scholar

[3]

Eric B. Baum and David Haussler. What size net gives valid generalization? Neural Computation, 1(1): 151-160, 1989.

Digital Library

Google Scholar

[4]

Avfim Blum. Empirical support for winnow and weightedmajority based algorithms: results on a calendar scheduling domain. In Proceedings of the Twelfth International Conj'krence on Machine Learning, pages 64-72, 1995.

Google Scholar

[5]

Leo Breiman. Aming classifiers. Annals of Statistics, to appear.

Google Scholar

[6]

Thomas G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization, llnpublished manuscript, 1998.

Google Scholar

[7]

Thomas G. Dietterich and Ghulum Bakiri. Solving multiclass learning problems via error-cmrecting output codes. Journal of Artificial Intelligence Research, 2:263-286, January 1995.

Digital Library

Google Scholar

[8]

Hams Dmckerand Cofinna Cortes. Boosting decision trees. In Advances in Neural Information Processing Systems 8, pages 479-485, 1996.

Google Scholar

[9]

Yoav Freund and Robert E. Schapire. F, xpefiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference, pages 148-156, 1996.

Digital Library

Google Scholar

[10]

Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1): 119-139, August 1997.

Digital Library

Google Scholar

[11]

Yoav Freund, Robert E. Schapire, Yoram Singer, and Manfred K. Wammth. Using and combining predictors that specialize. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Iheory of Computing, pages 334-343, 1997.

Digital Library

Google Scholar

[12]

David Haussler. Decision theoretic generalizations of the PAC model for neural net and other leaming applications. Information and Computation, 100(1):78-150, 1992.

Digital Library

Google Scholar

[13]

David Haussler and Philip M. Long. A generalization of Sauer's lemma. Journal of Combinatorial Theory, Series A, 71(2):219-240, 1995.

Digital Library

Google Scholar

[14]

Michael Keams and Yishay Mansour. On the boosting ability of top-down decision tree learning algorithms. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996.

Digital Library

Google Scholar

[15]

Richard Maclin and David Opitz. An empirical evaluation of bagging and boosting. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 546- 551, 1997.

Digital Library

Google Scholar

[16]

Dragos D. Margineantu and Thomas G. Dietterich. Pruning adaptive boosting. In Machine Learning: Proceedings of the Fourteenth International Conference, pages 211-218, 1997.

Digital Library

Google Scholar

[17]

C. J. Merz and P. M. Murphy. UCI repository of machine leaming Databases,1998. http://www.ics .uci.edu/,mtleam/MLRe pository.html.

Google Scholar

[18]

J. R. Quinlan. Bagging, boosting, and C4.5. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 725-730, 1996.

Digital Library

Google Scholar

[19]

Robert E. Schapire. Using output codes to boost multiclass learning problems. In Machine Learning: Proceedings of the Fourteenth International Conference, pages 313-321, 1997.

Digital Library

Google Scholar

[20]

Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistics, to appear.

Google Scholar

[21]

Robert E. Schapire and Yoram Singer. BoosTexter: A system for multiclass multi-label text categorization. Unpublished manuscript, 1998.

Google Scholar

[22]

}Iolger Schwenk and Yoshua Bengio. Training methods for adaptive boosting of neural networks for character recognition. In Advances in Neural Information Processing Systems 10, 1998.

Digital Library

Google Scholar

Cited By

View all

Sui QGhosh S(2024)Active Learning for Stacking and AdaBoost-Related ModelsStats10.3390/stats70100087:1(110-137)Online publication date: 24-Jan-2024
https://doi.org/10.3390/stats7010008
Shokouhifar MHasanvand MMoharamkhani EWerner F(2024)Ensemble Heuristic–Metaheuristic Feature Fusion Learning for Heart Disease Diagnosis Using Tabular DataAlgorithms10.3390/a1701003417:1(34)Online publication date: 14-Jan-2024
https://doi.org/10.3390/a17010034
Hayashi IIrie HTsuruse S(2024)Bagging Algorithm Based on Possibilistic Data Interpolation for Brain-Computer InterfaceJournal of Advanced Computational Intelligence and Intelligent Informatics10.20965/jaciii.2024.p062328:3(623-633)Online publication date: 20-May-2024
https://doi.org/10.20965/jaciii.2024.p0623
Show More Cited By

Index Terms

Improved boosting algorithms using confidence-rated predictions

Recommendations

Improved Boosting Algorithms Using Confidence-rated Predictions
The Eleventh Annual Conference on computational Learning Theory

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 ...
Improved AdaBoost.M1 of decision trees with confidence-rated predictions
SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

This paper proposes an algorithm to integrate AdaBoost.M1 with the decision trees that output confidence-rated predictions, which is done by transforming decision trees from "expert" models to "specialist" models that may abstain when the confidence is ...
Using boosting to prune bagging ensembles

Boosting is used to determine the order in which classifiers are aggregated in a bagging ensemble. Early stopping in the aggregation of the classifiers in the ordered bagging ensemble allows the identification of subensembles that require less memory ...

Comments

Information & Contributors

Information

Published In

COLT' 98: Proceedings of the eleventh annual conference on Computational learning theory

July 1998

304 pages

ISBN:1581130570

DOI:10.1145/279943

Chairmen:
Peter Bartlett
Australian National Univ., Australia
,
Yishay Mansour
Tel-Aviv Univ., Israel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

COLT98

Sponsor:

University of Wisconsin
SIGAI
SIGACT
UC @ Santa Cruz

COLT98: The 11th Annual Conference on Computational Learning Theroy

July 24 - 26, 1998

Wisconsin, Madison, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

340
Total Citations
View Citations
2,006
Total Downloads

Downloads (Last 12 months)531
Downloads (Last 6 weeks)55

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sui QGhosh S(2024)Active Learning for Stacking and AdaBoost-Related ModelsStats10.3390/stats70100087:1(110-137)Online publication date: 24-Jan-2024
https://doi.org/10.3390/stats7010008
Shokouhifar MHasanvand MMoharamkhani EWerner F(2024)Ensemble Heuristic–Metaheuristic Feature Fusion Learning for Heart Disease Diagnosis Using Tabular DataAlgorithms10.3390/a1701003417:1(34)Online publication date: 14-Jan-2024
https://doi.org/10.3390/a17010034
Hayashi IIrie HTsuruse S(2024)Bagging Algorithm Based on Possibilistic Data Interpolation for Brain-Computer InterfaceJournal of Advanced Computational Intelligence and Intelligent Informatics10.20965/jaciii.2024.p062328:3(623-633)Online publication date: 20-May-2024
https://doi.org/10.20965/jaciii.2024.p0623
Pérez-Cutiño MPikrakis ADíaz-Báñez JValverde J(2024)Meta-learning with hypernetworks: Cost-effective fault detection in Parabolic Trough plantsEngineering Applications of Artificial Intelligence10.1016/j.engappai.2024.108492133(108492)Online publication date: Jul-2024
https://doi.org/10.1016/j.engappai.2024.108492
Yin TChen HYuan ZSang BHorng SLi TLuo C(2024)LEFMIFS: Label enhancement and fuzzy mutual information for robust multilabel feature selectionEngineering Applications of Artificial Intelligence10.1016/j.engappai.2024.108108133(108108)Online publication date: Jul-2024
https://doi.org/10.1016/j.engappai.2024.108108
Han ZXie R(2024)Blind quality assessment of night-time photos: A region selective approachDisplays10.1016/j.displa.2024.10277484(102774)Online publication date: Oct-2024
https://doi.org/10.1016/j.displa.2024.102774
Roshan STanha JZarrin MBabaei ANikkhah HJafari Z(2024)A deep ensemble medical image segmentation with novel sampling method and loss functionComputers in Biology and Medicine10.1016/j.compbiomed.2024.108305172(108305)Online publication date: May-2024
https://doi.org/10.1016/j.compbiomed.2024.108305
Rahman MShiplu AWatanobe Y(2024)CommentClass: A Robust Ensemble Machine Learning Model for Comment ClassificationInternational Journal of Computational Intelligence Systems10.1007/s44196-024-00589-317:1Online publication date: 15-Jul-2024
https://doi.org/10.1007/s44196-024-00589-3
Bhalla SKumar AKushwaha R(2024)Analysis of recent techniques in marine object detection: a reviewMultimedia Tools and Applications10.1007/s11042-024-19782-9Online publication date: 11-Jul-2024
https://doi.org/10.1007/s11042-024-19782-9
Shiplu ARahman MWatanobe Y(2024)A Robust Ensemble Machine Learning Model with Advanced Voting Techniques for Comment ClassificationBig Data Analytics in Astronomy, Science, and Engineering10.1007/978-3-031-58502-9_10(141-159)Online publication date: 27-Apr-2024
https://doi.org/10.1007/978-3-031-58502-9_10
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations