The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Multi-class AdaBoost
Open accessAbstract
Boosting has been a very successful technique for solving the two-class classification problem.In going from two-class to multi-class classification, most algorithms have been restricted to reducing the multi-class classification problem to multiple two-class problems.In this paper, we develop a new algorithm that directly extends the AdaBoost algorithm to the multi-class case without reducing it to multiple two-class problems.We show that the proposed multi-class AdaBoost algorithm is equivalent to a forward stagewise additive modeling algorithm that minimizes a novel exponential loss for multi-class classification.Furthermore, we show that the exponential loss is a member of a class of Fisher-consistent loss functions for multi-class classification.As shown in the paper, the new algorithm is extremely easy to implement and is highly competitive in terms of misclassification error rate.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Self-citationClassification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 10×
“There are also several other multiclass extensions of the boosting idea, for example, the ECOC in [19] and the logit-boost in [11].”
BackgroundMethodInfluentialSelf-citationImproved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
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
Boosting With the L2Loss: Regression and Classification
Bühlmann, P., & Yu, B. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503000125 · Cited by 845
Bishop, C. M. (2004) · Handbook of Neural Computation · doi:10.1887/0750303123/b365c43 · Cited by 833
Lee, Y., Lin, Y., & Wahba, G. (2004) · Journal of the American Statistical Association · doi:10.1198/016214504000000098 · Cited by 741
Boosting 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
Another approach to polychotomous classification
Friedman, J. H. (1996) · Medical Entomology and Zoology · Cited by 577
Prediction Games and Arcing Algorithms
Breiman, L. (1999) · Neural Computation · doi:10.1162/089976699300016106 · Cited by 530
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
Koltchinskii, V., & Panchenko, D. (2002) · The Annals of Statistics · doi:10.1214/aos/1015362183 · Cited by 451
Using output codes to boost multiclass learning problems
Schapire, R. E. (1997) · International Conference on Machine Learning · Cited by 297
Statistical Analysis of Some Multi-Category Large Margin Classification Methods
Zhang, T. (2004) · doi:10.5555/1005332.1044701 · Cited by 215
A note on margin-based loss functions in classification
Lin, Y. (2004) · Statistics & Probability Letters · doi:10.1016/j.spl.2004.03.002 · Cited by 181
Boosting Algorithms as Gradient Descent in Function Space
Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. R. (1999) · Cited by 156
Liu, Y., & Shen, X. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000781 · Cited by 145
Lee, Y., Lee, Y., Lee, Y., Lin, Y., Lin, Y., Wahba, G., & Wahba, G. (2002) · Cited by 21
Cited by
Dong, X., Yu, Z., Cao, W., Shi, Y., & Ma, Q. (2020) · Frontiers of Computer Science · doi:10.1007/s11704-019-8208-z · Cited by 1,928
Zio, E. (2022) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2021.108119 · Cited by 714
González, S., García, S., Del Ser, J., Rokach, L., & Herrera, F. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.07.007 · Cited by 582
Sun, H., Burton, H. V., & Huang, H. (2021) · Journal of Building Engineering · doi:10.1016/j.jobe.2020.101816 · Cited by 544
Khan, A. A., Chaudhari, O., & Chandra, R. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122778 · Cited by 530
Metadata
- Authors
- Hastie, T., Rosset, S., Zhu, J., & Zou, H.
- Venue
- Statistics and Its Interface
- Publisher
- International Press of Boston
- Published
- 2009
- Volume
- 2
- Issue
- 3
- Pages
- 349-360
- ISSN
- 1938-7989 (ISSN-L)
- 1938-7997
- OpenAlex
- W1968969471
- Cited by
- 1,875
- References
- 26
- FWCI
- 33.97
- Type
- journal article
- Language
- en
- Open access
- bronze
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.