The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
AdaBoost with SVM-based component classifiers
Abstract
The use of SVM (Support Vector Machine) as component classifier in AdaBoost may seem like going against the grain of the Boosting principle since SVM is not an easy classifier to train. Moreover, Wickramaratna et al. [2001. Performance degradation in boosting. In: Proceedings of the Second International Workshop on Multiple Classifier Systems, pp. 11-21] show that AdaBoost with strong component classifiers is not viable. In this paper, we shall show that AdaBoost incorporating properly designed RBFSVM (SVM with the RBF kernel) component classifiers, which we call AdaBoostSVM, can perform as well as SVM. Furthermore, the proposed AdaBoostSVM demonstrates better generalization performance than SVM on imbalanced classification problems. The key idea of AdaBoostSVM is that for the sequence of trained RBFSVM component classifiers, starting with large @s values (implying weak learning), the @s values are reduced progressively as the Boosting iteration proceeds. This effectively produces a set of RBFSVM component classifiers whose model parameters are adaptively different manifesting in better generalization as compared to AdaBoost approach with SVM component classifiers using a fixed (optimal) @s value. From benchmark data sets, we show that our AdaBoostSVM approach outperforms other AdaBoost approaches using component classifiers such as Decision Trees and Neural Networks. AdaBoostSVM can be seen as a proof of concept of the idea proposed in Valentini and Dietterich [2004. Bias-variance analysis of support vector machines for the development of SVM-based ensemble methods. Journal of Machine Learning Research 5, 725-775] that Adaboost with heterogeneous SVMs could work well. Moreover, we extend AdaBoostSVM to the Diverse AdaBoostSVM to address the reported accuracy/diversity dilemma of the original Adaboost. By designing parameter adjusting strategies, the distributions of accuracy and diversity over RBFSVM component classifiers are tuned to maintain a good balance between them and promising results have been obtained on benchmark data sets.
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
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
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×
“This journal article is available at Research Online: https://ro.uow.edu.au/eispapers/602 Engineering Applications of Artificial Intelligence 21 (2008) 785–795 AdaBoost with SVM-based component classifiers Xuchun Li , Lei Wang, Eric Sung School of Electrical and Electronic Engineering, Nanyang…”
MethodAdvances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
The use of the area under the ROC curve in the evaluation of machine learning algorithms
Bradley, A. P. (1997) · Pattern Recognition · doi:10.1016/s0031-3203(96)00142-2 · Cited by 7,217
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691
Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms
Dietterich, T. G. (1998) · Neural Computation · doi:10.1162/089976698300017197 · Cited by 3,840
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953 · cited 11×
“X. Li et al. / Engineering Applications of Artificial Intelligence 21 (2008) 785–795 789 f ðxiÞ is the combined prediction label of all the existing component classifiers, the diversity of the tth component classifier on the sample xi is calculated as: dtðxiÞ ¼ 0 if htðxiÞ ¼ f ðxiÞ 1 if htðxiÞaf ðxiÞ ( (7) and the div…”
MethodInfluentialDietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
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
Improved 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
Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy
Kuncheva, L. I., & Whitaker, C. J. (2003) · Machine Learning · doi:10.1023/a:1022859003006 · Cited by 2,335 · cited 1×
“AdaBoostSVM can be seen as a proof of concept of the idea proposed in Valentini and Dietterich [2004.”
MethodBoosting 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
Addressing the Curse of Imbalanced Training Sets: One-Sided Selection.
Kubát, M., & Matwin, S. (1997) · Cited by 2,230
Editorial: special issue on learning from imbalanced data sets
Chawla, N. V., Japkowicz, N., & Kotcz, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007733 · Cited by 2,063
The Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Improved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
Generalized Discriminant Analysis Using a Kernel Approach
Baudat, G., & Anouar, F. (2000) · Neural Computation · doi:10.1162/089976600300014980 · Cited by 1,673
The Analysis of Contingency Tables
Odoroff, C. L. (1978) · Technometrics · doi:10.1080/00401706.1978.10489678 · Cited by 1,541
Comparing support vector machines with Gaussian kernels to radial basis function classifiers
Scholkopf, B., Sung, K.-K., Burges, C. J. C., Girosi, F., Niyogi, P., Poggio, T., & Vapnik, V. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650102 · Cited by 1,400
Rätsch, G., Onoda, T., & Müller, K.-R. (2001) · Machine Learning · doi:10.1023/a:1007618119488 · Cited by 1,299
IEICE transactions on information and systems
電子情報通信学会 (1992) · Institute of Electronics, Information and Communication Engineers eBooks · Cited by 1,185
Applying Support Vector Machines to Imbalanced Datasets
Akbani, R., Kwek, S., & Japkowicz, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30115-8_7 · Cited by 1,134
Fawcett, T., & Provost, F. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009700419189 · Cited by 881
Cristianini, N., Kandola, J., Elisseeff, A., & Shawe-Taylor, J. (2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-33486-6_8 · Cited by 837
Controlling the Sensitivity of Support Vector Machines
Veropoulos, K., Campbell, I. C. G., & Cristianini, N. (1999) · Cited by 708
Data mining for direct marketing: problems and solutions
Ling, C. X., & Cheng-hui, L. (1998) · Cited by 661
Construction and Assessment of Classification Rules
Wade, M. R., & Hand, D. J. (1999) · Technometrics · doi:10.2307/1270579 · Cited by 621
Learning from imbalanced data sets with boosting and data generation: the DataBoost-IM approach
Guo, H., & Viktor, H. L. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007736 · Cited by 605
Margineantu, D. D., & Dietterich, T. G. (1997) · Cited by 553
Construction and Assessment of Classification Rules.
Ringrose, T. J., & Hand, D. J. (1997) · Biometrics · doi:10.2307/2533581 · Cited by 488
Nonlinear Estimation and Classification
(2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2 · Cited by 390
KBA: kernel boundary alignment considering imbalanced data distribution
Wu, G., & Chang, E. Y. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.95 · Cited by 380
Adressing the curse of imbalanced training sets: one-sided selection
Kubát, M. (1997) · Medical Entomology and Zoology · Cited by 328
Proceedings of the 17th International Conference on Pattern Recognition
(2004) · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · doi:10.1109/icpr.2004.1333673 · Cited by 298
Schwenk, H., & Bengio, Y. (2000) · Neural Computation · doi:10.1162/089976600300015178 · Cited by 297
Creating diversity in ensembles using artificial data
Melville, P., & Mooney, R. J. (2005) · Information Fusion · doi:10.1016/j.inffus.2004.04.001 · Cited by 294
Bias-Variance Analysis of Support Vector Machines for the Development of SVM-Based Ensemble Methods
Valentini, G., & Dietterich, T. G. (2004) · doi:10.5555/1005332.1016783 · Cited by 250
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria
Drummond, C., & Holte, R. C. (2000) · Cited by 198
On predicting rare classes with SVM ensembles in scene classification
Yan, R., Liu, Y., Jin, R., & Hauptmann, A. G. (2003) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2003.1199097 · Cited by 133
Proceedings of the 9th European Conference on Machine Learning
van Someren, M., & Widmer, G. (1997) · European conference on Machine Learning · Cited by 116
Diversity measures for multiple classifier system analysis and design
Windeatt, T. (2004) · Information Fusion · doi:10.1016/j.inffus.2004.04.002 · Cited by 108
A multistrategy approach for digital text categorization from imbalanced documents
del Castillo, M. D., & Serrano, J. I. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007740 · Cited by 64
Domeniconi, C., & Yan, B. (2004) · Cited by 47
Proceedings of the 10th European Conference on Machine Learning
Nédellec, C., & Rouveirol, C. (1998) · Cited by 35
A Solution for Imbalanced Training Sets Problem by CombNET-II and Its Application on Fog Forecasting
Nugroho, A. S., Kuroyanagi, S., & Iwata, A. (2002) · Institutional Repositories DataBase (IRDB) · Cited by 19
Boosting with Diverse Base Classifiers
Dasgupta, S., & Long, P. M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_21 · Cited by 17
Cited by
DUNet: A deformable network for retinal vessel segmentation
Jin, Q., Meng, Z., Pham, T. D., Chen, Q., Wei, L., & Su, R. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.04.025 · Cited by 867
Khan, A. A., Chaudhari, O., & Chandra, R. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122778 · Cited by 530
A support vector machine-based ensemble algorithm for breast cancer diagnosis
Wang, H., Zheng, B., Yoon, S. W., & Ko, H. S. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.12.001 · Cited by 440
Cost-sensitive learning methods for imbalanced data
Thai-Nghe, N., Gantner, Z., & Schmidt-Thieme, L. (2010) · The 2010 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2010.5596486 · Cited by 342
Multifractal Texture Estimation for Detection and Segmentation of Brain Tumors
Islam, A., Reza, S. M. S., & Iftekharuddin, K. M. (2013) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2013.2271383 · Cited by 319
Metadata
- Authors
- Li, X., Wang, L., & Sung, E.
- Venue
- Engineering Applications of Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2008-08
- Volume
- 21
- Issue
- 5
- Pages
- 785-795
- ISSN
- 0952-1976 (ISSN-L)
- OpenAlex
- W1987859285
- Cited by
- 392
- References
- 49
- FWCI
- 9.46
- Type
- journal article
- 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.