The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Improved boosting algorithms using confidence-rated predictions
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...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Self-citationAdvances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
Solving Multiclass Learning Problems via Error-Correcting Output Codes
Dietterich, T. G., & Bakiri, G. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.105 · Cited by 2,739
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Self-citationQuinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,586
What Size Net Gives Valid Generalization?
Baum, E. B., & Haussler, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.1.151 · Cited by 1,541
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Cited by
Items 101–113 of 113
Boosting Local Binary Pattern (LBP)-Based Face Recognition
Zhang, G., Huang, X., Li, S. Z., Wang, Y., & Wu, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30548-4_21 · Cited by 271
An Adaptive Version of the Boost by Majority Algorithm
Freund, Y. (2001) · Machine Learning · doi:10.1023/a:1010852229904 · Cited by 270
Evaluating boosting algorithms to classify rare classes: comparison and improvements
Joshi, M. V., Kumar, V., & Agarwal, R. C. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989527 · Cited by 268
Ensemble with neural networks for bankruptcy prediction
Kim, M.-J., & Kang, D.-K. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.10.012 · Cited by 264
Signatures of a Statistical Computation in the Human Sense of Confidence
Sanders, J. I., Hangya, B., & Kepecs, A. (2016) · Neuron · doi:10.1016/j.neuron.2016.03.025 · Cited by 253
Binary Ensemble Neural Network: More Bits per Network or More Networks per Bit?
Zhu, S., Dong, X., & Su, H. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00506 · Cited by 153
3D facial expression recognition based on automatically selected features
Tang, H., & Huang, T. S. (2008) · 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops · doi:10.1109/cvprw.2008.4563052 · Cited by 140
Ramírez-Gallego, S., Fernández, A., García, S., Chen, M., & Herrera, F. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.10.001 · Cited by 140
Regionlets for Generic Object Detection
Wang, X., Yang, M., Zhu, S., & Lin, Y. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2389830 · Cited by 107
Weather Recognition Based on Images Captured by Vision System in Vehicle
Yan, X., Luo, Y., & Zheng, X. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01513-7_42 · Cited by 92
Akhter, I., Jalal, A., & Kim, K. (2021) · 2021 International Bhurban Conference on Applied Sciences and Technologies (IBCAST) · doi:10.1109/ibcast51254.2021.9393293 · Cited by 58
Compressive Sequential Learning for Action Similarity Labeling
Qin, J., Liu, L., Zhang, Z., Wang, Y., & Shao, L. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2508600 · Cited by 55
Quantum computing and supervised machine learning
Oneto, L., Ridella, S., & Anguita, D. (2017) · Quantum Inspired Computational Intelligence · doi:10.1016/b978-0-12-804409-4.00002-4 · Cited by 11
Metadata
- Authors
- Schapire, R. E., & Singer, Y.
- Venue
- Proceedings of the eleventh annual conference on Computational learning theory
- Publisher
- ACM
- Published
- 1998-07-24
- Pages
- 80-91
- OpenAlex
- W2032210760
- Cited by
- 2,547
- References
- 25
- FWCI
- 31.77
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.