The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
RUSBoost: A Hybrid Approach to Alleviating Class Imbalance
Abstract
Class imbalance is a problem that is common to many application domains. When examples of one class in a training data set vastly outnumber examples of the other class(es), traditional data mining algorithms tend to create suboptimal classification models. Several techniques have been used to alleviate the problem of class imbalance, including data sampling and boosting. In this paper, we present a new hybrid sampling/boosting algorithm, called RUSBoost, for learning from skewed training data. This algorithm provides a simpler and faster alternative to SMOTEBoost, which is another algorithm that combines boosting and data sampling. This paper evaluates the performances of RUSBoost and SMOTEBoost, as well as their individual components (random undersampling, synthetic minority oversampling technique, and AdaBoost). We conduct experiments using 15 data sets from various application domains, four base learners, and four evaluation metrics. RUSBoost and SMOTEBoost both outperform the other procedures, and RUSBoost performs comparably to (and often better than) SMOTEBoost while being a simpler and faster technique. Given these experimental results, we highly recommend RUSBoost as an attractive alternative for improving the classification performance of learners built using imbalanced data.
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
(1992) · Cited by 23,431
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Witten, I. H. (2008) · Cited by 9,143
The relationship between Precision-Recall and ROC curves
Davis, J., & Goadrich, M. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143874 · Cited by 6,559
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
A study of the behavior of several methods for balancing machine learning training data
Batista, G. E. A. P. A., Prati, R. C., & Monard, M. C. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007735 · Cited by 4,203
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
A Short Introduction to Boosting
Freund, Y., & Schapire, R. E. (1999) · Cited by 3,140
The foundations of cost-sensitive learning
Elkan, C. (2001) · Cited by 1,945
SMOTEBoost: 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
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
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
On Measures of Information and their Characterizations
(1975) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6157-0 · Cited by 811
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-citationAdaCost: Misclassification Cost-Sensitive Boosting
Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999) · Cited by 612
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
Learning from Imbalanced Data Sets: A Comparison of Various Strategies *
Japkowicz, N. (2000) · Cited by 455
Incremental Reduced Error Pruning
Fürnkranz, J., & Widmer, G. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50017-9 · Cited by 376
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
Automatically countering imbalance and its empirical relationship to cost
Chawla, N. V., Cieslak, D. A., Hall, L. O., & Joshi, A. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0087-0 · Cited by 255
Boosted Classification Trees and Class Probability/Quantile Estimation
Mease, D., Wyner, A. J., & Buja, A. (2007) · ScholarlyCommons (University of Pennsylvania) · doi:10.5555/1248659.1248675 · Cited by 243
Weiss, G. M., McCarthy, K., & Zabar, B. (2007) · DMIN · Cited by 234
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
Intermediate 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
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
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
Good practice in retail credit scorecard assessment
Hand, D. J. (2005) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601932 · Cited by 119
Learning 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-citationPrecision-recall operating characteristic (P-ROC) curves in imprecise environments
Landgrebe, T. C. W., Paclík, P., & Duin, R. P. W. (2006) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2006.941 · Cited by 95
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-citation(1996)
Cited by
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2161285 · Cited by 2,794
Learning from class-imbalanced data: Review of methods and applications
Haixiang, G., Yijing, L., Shang, J., Mingyun, G., Yuanyue, H., & Bing, G. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.12.035 · Cited by 2,377
Text Data Augmentation for Deep Learning
Shorten, C., Khoshgoftaar, T. M., & Furht, B. (2021) · Journal of Big Data · doi:10.1186/s40537-021-00492-0 · Cited by 1,740
Self-citationLó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
A Survey of Predictive Modeling on Imbalanced Domains
Branco, P., Torgo, L., & Ribeiro, R. P. (2017) · ACM Computing Surveys · doi:10.1145/2907070 · Cited by 1,129
Metadata
- Authors
- Seiffert, C., Khoshgoftaar, T. M., Van Hulse, J., & Napolitano, A.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2010-01
- Volume
- 40
- Issue
- 1
- Pages
- 185-197
- ISSN
- 1083-4427 (ISSN-L)
- 1558-2426
- OpenAlex
- W2096945460
- Cited by
- 1,867
- References
- 37
- FWCI
- 14.10
- 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.