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
Arcing classifier (with discussion and a rejoinder by the author)
Breiman, L. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691079 · Cited by 1,105
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
An Efficient Boosting Algorithm for Combining Preferences
Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (1998) · Cited by 806
Self-citationBoosting the margin: A new explanation for the effectiveness of voting methods
Schapire, R. E., Freund, Y., Barlett, P., & Lee, W. S. (1997) · Cited by 711
Self-citationMargineantu, D. D., & Dietterich, T. G. (1997) · Cited by 553
Using output codes to boost multiclass learning problems
Schapire, R. E. (1997) · International Conference on Machine Learning · Cited by 297
Self-citationAn empirical evaluation of bagging and boosting
Maclin, R., & Opitz, D. W. (1997) · Cited by 265
Using and combining predictors that specialize
Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258616 · Cited by 234
Self-citationDrucker, H., & Cortes, C. (1995) · neural information processing systems · Cited by 229
Blum, A. (1997) · Machine Learning · doi:10.1023/a:1007335615132 · Cited by 191
On the boosting ability of top-down decision tree learning algorithms
Kearns, M. J., & Mansour, Y. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237994 · Cited by 115
Machine Learning: Proceedings of the Fifteenth International Conference
SHAVLIK, J. W. (1998) · Defense Technical Information Center (DTIC) · doi:10.21236/ada350721 · Cited by 89
A generalization of Sauer's lemma
Haussler, D. H., & Long, P. M. (1995) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(95)90001-2 · Cited by 86
Blum, A. L. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50017-7 · Cited by 72
(1996)
Cited by
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
ML-KNN: A lazy learning approach to multi-label learning
Zhang, M.-L., & Zhou, Z.-H. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.12.019 · Cited by 3,552
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.