The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Comparing Boosting and Bagging Techniques With Noisy and Imbalanced Data
Abstract
This paper compares the performance of several boosting and bagging techniques in the context of learning from imbalanced and noisy binary-class data. Noise and class imbalance are two well-established data characteristics encountered in a wide range of data mining and machine learning initiatives. The learning algorithms studied in this paper, which include SMOTEBoost, RUSBoost, Exactly Balanced Bagging, and Roughly Balanced Bagging, combine boosting or bagging with data sampling to make them more effective when data are imbalanced. These techniques are evaluated in a comprehensive suite of experiments, for which nearly four million classification models were trained. All classifiers are assessed using seven different performance metrics, providing a complete perspective on the performance of these techniques, and results are tested for statistical significance via analysis-of-variance modeling. The experiments show that the bagging techniques generally outperform boosting, and hence in noisy data environments, bagging is the preferred method for handling class imbalance.
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
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,387
Witten, I. H. (2008) · Cited by 9,143
Borderline-SMOTE : A New Over-Sampling Method in Imbalanced Data Sets Learning
Han, H., Wang, W.-Y., & Mao, B.-H. (2005) · Lecture notes in computer science · doi:10.1007/11538059_91 · Cited by 4,331
The class imbalance problem: A systematic study1
Japkowicz, N., & Stephen, S. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6504 · Cited by 3,295
Exploratory Undersampling for Class-Imbalance Learning
Liu, X.-Y., Wu, J., & Zhou, Z.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2007853 · Cited by 2,465
Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
Wilson, D. L. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309137 · Cited by 2,130
RUSBoost: A Hybrid Approach to Alleviating Class Imbalance
Seiffert, C., Khoshgoftaar, T. M., Van Hulse, J., & Napolitano, A. (2010) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2009.2029559 · Cited by 1,867
Self-citationSMOTEBoost: Improving Prediction of the Minority Class in Boosting
Chawla, N. V., Lazarevic, A., Hall, L. O., & Bowyer, K. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39804-2_12 · Cited by 1,668
Cost-sensitive boosting for classification of imbalanced data
Sun, Y., Kamel, M. S., Wong, A. K. C., & Wang, Y. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.009 · Cited by 1,423
Mining with rarity: a unifying framework
Weiss, G. M. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007734 · Cited by 1,393
A Multiple Resampling Method for Learning from Imbalanced Data Sets
Estabrooks, A., Jo, T., & Japkowicz, N. (2004) · Computational Intelligence · doi:10.1111/j.0824-7935.2004.t01-1-00228.x · Cited by 1,014
Learning when training data are costly: the effect of class distribution on tree induction
Weiss, G. M., & Provost, F. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1199 · Cited by 921
Class Noise vs. Attribute Noise: A Quantitative Study
Zhu, X., & Wu, X. (2004) · Artificial Intelligence Review · doi:10.1007/s10462-004-0751-8 · Cited by 893
C4.5, Class Imbalance, and Cost Sensitivity: Why Under-Sampling beats Over-Sampling
Drummond, C., & Holte, R. C. (2003) · Cited by 799
Experimental perspectives on learning from imbalanced data
Van Hulse, J., Khoshgoftaar, T. M., & Napolitano, A. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273614 · Cited by 786
Self-citationIdentifying Mislabeled Training Data
Brodley, C. E., & Friedl, M. A. (1999) · Cited by 718
Identifying Mislabeled Training Data
Brodley, C. E., & Friedl, M. A. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.606 · Cited by 612
AdaCost: Misclassification Cost-Sensitive Boosting
Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999) · Cited by 612
Learning When Data Sets are Imbalanced and When Costs are Unequal and Unknown
Maloof, M. A. (2003) · Cited by 406
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
A Comparative Study of Cost-Sensitive Boosting Algorithms
Ting, K. M. (2000) · Cited by 262
The Imbalanced Training Sample Problem: Under or over Sampling?
Barandela, R., Valdovinos, R. M., Sánchez, J. S., & Ferri, F. J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27868-9_88 · Cited by 234
Roughly balanced bagging for imbalanced data
Hido, S., Kashima, H., & Takahashi, Y. (2009) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10061 · Cited by 227
A Study on the Relationships of Classifier Performance Metrics
Seliya, N., Khoshgoftaar, T. M., & Van Hulse, J. (2009) · 2009 21st IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/ictai.2009.25 · Cited by 224
Self-citationKnowledge discovery from imbalanced and noisy data
Van Hulse, J., & Khoshgoftaar, T. (2009) · Data & Knowledge Engineering · doi:10.1016/j.datak.2009.08.005 · Cited by 202
Self-citationIntermediate Statistical Methods and Applications: A Computer Package Approach
Berenson, M. L., Levine, D. M., & Goldstein, M. (1982) · Andalas University Repository (Andalas University) · Cited by 194
Experiments with Noise Filtering in a Medical Domain
Gamberger, D., Lavrač, N., & Grošelj, C. (1999) · Cited by 180
Teng, C.-M. (1999) · International Conference on Machine Learning · Cited by 173
Intermediate Statistical Methods and Applications: A Computer Package Approach.
Weisberg, S., Berenson, M. L., Levine, D. M., Goldstein, M., Cooper, R. A., & Weekes, A. J. (1984) · Journal of the American Statistical Association · doi:10.2307/2288297 · Cited by 144
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
Estimating class probabilities in random forests
Boström, H. (2007) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2007.64 · Cited by 125
EUS SVMs: Ensemble of Under-Sampled SVMs for Data Imbalance Problems
Kang, P., & Cho, S. (2006) · Lecture notes in computer science · doi:10.1007/11893028_93 · Cited by 124
Improving Software-Quality Predictions With Data Sampling and Boosting
Seiffert, C., Khoshgoftaar, T. M., & Hulse, J. V. (2009) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/tsmca.2009.2027131 · Cited by 113
Self-citationLearning with limited minority class data
Khoshgoftaar, T. M., Seiffert, C., Hulse, J. V., Napolitano, A., & Folleco, A. (2007) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2007.76 · Cited by 110
Self-citationBrodley, C. E., & Friedl, M. A. (2002) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss.1996.516669 · Cited by 75
AveBoost2: Boosting for Noisy Data
Oza, N. C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25966-4_3 · Cited by 44
Building Useful Models from Imbalanced Data with Sampling and Boosting
Seiffert, C., Khoshgoftaar, T. M., Hulse, J. V., & Napolitano, A. (2008) · Cited by 42
Self-citationFacing Imbalanced Classes through Aggregation of Classifiers
Molinara, M., Ricamato, M. T., & Tortorella, F. (2007) · International Conference on Image Analysis and Processing · doi:10.1109/iciap.2007.4362755 · Cited by 41
A boosting approach to remove class label noise
Karmaker, A., & Kwek, S. S. (2005) · International Conference on Hybrid Intelligent Systems (HIS) · doi:10.1109/ichis.2005.1 · Cited by 40
Some Theoretical Aspects of Boosting in the Presence of Noisy Data
Jiang, W. (2001) · Cited by 33
Robustness of learning techniques in handling class noise in imbalanced datasets
Anyfantis, D., Karagiannopoulos, M. G., Kotsiantis, S. B., & Pintelas, P. (2007) · Springer eBooks · doi:10.1007/978-0-387-74161-1_3 · Cited by 30
Class noise detection using frequent itemsets
Hulse, J. V., & Khoshgoftaar, T. M. (2006) · Intelligent Data Analysis · doi:10.3233/ida-2006-10602 · Cited by 29
Self-citationWhen Efficient Model Averaging Out-Performs Boosting and Bagging
Davidson, I. A. K., & Fan, W. (2006) · Lecture notes in computer science · doi:10.1007/11871637_46 · Cited by 29
A Hybrid Classification Scheme for Mining Multisource Geospatial Data
Vatsavai, R. R., & Bhaduri, B. (2007) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2007.96 · Cited by 20
Skewed Class Distributions and Mislabeled Examples
Hulse, J. V., Khoshgoftaar, T. M., & Napolitano, A. (2007) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2007.34 · Cited by 17
Self-citationThe multiple imputation quantitative noise corrector
Khoshgoftaar, T. M., Hulse, J. V., Seiffert, C., & Zhao, L. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11303 · Cited by 6
Self-citation(1996)
Cited by
SMOTE for Learning from Imbalanced Data: Progress and Challenges, Marking the 15-year Anniversary
Fernandez, A., Garcia, S., Herrera, F., & Chawla, N. V. (2018) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11192 · Cited by 2,219
López, V., Fernández, A., García, S., Palade, V., & Herrera, F. (2013) · Information Sciences · doi:10.1016/j.ins.2013.07.007 · Cited by 1,590
Training and assessing classification rules with imbalanced data
Menardi, G., & Torelli, N. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0295-5 · Cited by 765
Khan, A. A., Chaudhari, O., & Chandra, R. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122778 · Cited by 530
Survey of review spam detection using machine learning techniques
Crawford, M., Khoshgoftaar, T. M., Prusa, J. D., Richter, A. N., & Al Najada, H. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0029-9 · Cited by 502
Self-citation
Metadata
- Authors
- Khoshgoftaar, T. M., Van Hulse, J., & Napolitano, A.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2011-05
- Volume
- 41
- Issue
- 3
- Pages
- 552-568
- ISSN
- 1083-4427 (ISSN-L)
- 1558-2426
- OpenAlex
- W2170413589
- Cited by
- 300
- References
- 49
- FWCI
- 11.56
- 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.