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 · cited 3×
“1 Simulation We mimic a popular simulation example found in Breiman et al. (1984). This is a three-class problem with twenty one variables, and it is considered to be a difficult pattern recognition problem with Bayes error equal to 0.”
BackgroundMethodInfluentialClassification 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-citation
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
Fake News Detection Using Machine Learning Ensemble Methods
Ahmad, I., Yousaf, M., Yousaf, S., & Ahmad, M. O. (2020) · Complexity · doi:10.1155/2020/8885861 · Cited by 474
Boosting methods for multi-class imbalanced data classification: an experimental review
Tanha, J., Abdi, Y., Samadi, N., Razzaghi, N., & Asadpour, M. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00349-y · Cited by 452
Dynamic classifier selection: Recent advances and perspectives
Cruz, R. M. O., Sabourin, R., & Cavalcanti, G. D. C. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.09.010 · Cited by 440
Evaluation of handwriting kinematics and pressure for differential diagnosis of Parkinson's disease
Drotár, P., Mekyska, J., Rektorová, I., Masarová, L., Smékal, Z., & Faundez-Zanuy, M. (2016) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2016.01.004 · Cited by 374
Multifaceted protein–protein interaction prediction based on Siamese residual RCNN
Chen, M., Ju, C. J. T., Zhou, G., Chen, X., Zhang, T., Chang, K.-W., Zaniolo, C., & Wang, W. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz328 · Cited by 372
Li, D., Zhang, Z., Liu, P., Wang, Z., & Zhang, L. (2021) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2020.3008194 · Cited by 345
Deep Learning for Medical Image-Based Cancer Diagnosis
Jiang, X., Hu, Z., Wang, S., & Zhang, Y. (2023) · Cancers · doi:10.3390/cancers15143608 · Cited by 345
Towards explainable deep neural networks (xDNN)
Angelov, P., & Soares, E. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.07.010 · Cited by 292
Boosting Algorithms: A Review of Methods, Theory, and Applications
Ferreira, A. J., & Figueiredo, M. A. T. (2012) · Ensemble Machine Learning · doi:10.1007/978-1-4419-9326-7_2 · Cited by 295
Ghimire, D., & Lee, J. (2013) · Sensors · doi:10.3390/s130607714 · Cited by 291
Taherkhani, A., Cosma, G., & McGinnity, T. M. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.03.064 · Cited by 281
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
“nsemble strategy can improve the accuracy of given learning algorithm combining multiple weak classifiers as summarized by [6, 9, 47]. The two most common strategies are bagging by [5] and boosting by [51, 17, 53, 26], which were proposed many years ago and have strong statistical foundation. They have roots in a theor…”
Background(2013) · Cited by 131
Kull, M., Silva Filho, T. M., & Flach, P. (2017) · Electronic Journal of Statistics · doi:10.1214/17-ejs1338si · Cited by 111
M-AdaBoost-A based ensemble system for network intrusion detection
Zhou, Y., Mazzuchi, T. A., & Sarkani, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113864 · Cited by 99
Detection of Cyber-attacks to indoor real time localization systems for autonomous robots
Guerrero-Higueras, Á. M., DeCastro-García, N., & Matellán, V. (2018) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2017.10.006 · Cited by 91
Miller, J., Taori, R., Raghunathan, A., Sagawa, S., Koh, P. W., Shankar, V., Liang, P., Carmon, Y., & Schmidt, L. (2021) · arXiv · doi:10.48550/arxiv.2107.04649 · Cited by 74
Machine learning for glass science and engineering: A review
Liu, H., Fu, Z., Yang, K., Xu, X., & Bauchy, M. (2019) · Journal of Non-Crystalline Solids: X · doi:10.1016/j.nocx.2019.100036 · Cited by 53
Temporal feature aggregation with attention for insider threat detection from activity logs
Pal, P., Chattopadhyay, P., & Swarnkar, M. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119925 · Cited by 52
Morris, J. S., Luthra, R., Liu, Y., Duose, D. Y., Lee, W., Reddy, N. G., Windham, J., Chen, H., Tong, Z., Zhang, B., et al. (2021) · Clinical Cancer Research · doi:10.1158/1078-0432.ccr-20-2403 · Cited by 36
Towards Long-term Non-invasive Monitoring for Epilepsy via Wearable EEG Devices
Ingolfsson, T. M., Cossettini, A., Wang, X., Tabanelli, E., Tagliavini, G., Ryvlin, P., Benini, L., & Benatti, S. (2021) · 2021 IEEE Biomedical Circuits and Systems Conference (BioCAS) · doi:10.1109/biocas49922.2021.9644949 · Cited by 35
Optimising insider threat prediction: Exploring BiLSTM networks and sequential features
Manoharan, P., Hong, W., Yin, J., Wang, H., Zhang, Y., & Ye, W. (2024) · Data Science and Engineering · doi:10.1007/s41019-024-00260-z · Cited by 22
Li, R., Song, F., Zhou, Q., Wu, W., Cao, Y., Zhang, G., Qian, Z., & Wang, L. (2025) · Journal of Magnetic Resonance Imaging · doi:10.1002/jmri.29399 · Cited by 10
Kumpf, K., Protic, M., Jovanovic, L., Cajic, M., Zivkovic, M., & Bacanin, N. (2024) · 2024 International Conference on Circuit, Systems and Communication (ICCSC) · doi:10.1109/iccsc62074.2024.10616526 · Cited by 7
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.