The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Evolutionary Undersampling for Classification with Imbalanced Datasets: Proposals and Taxonomy
Abstract
Learning with imbalanced data is one of the recent challenges in machine learning. Various solutions have been proposed in order to find a treatment for this problem, such as modifying methods or the application of a preprocessing stage. Within the preprocessing focused on balancing data, two tendencies exist: reduce the set of examples (undersampling) or replicate minority class examples (oversampling). Undersampling with imbalanced datasets could be considered as a prototype selection procedure with the purpose of balancing datasets to achieve a high classification rate, avoiding the bias toward majority class examples. Evolutionary algorithms have been used for classical prototype selection showing good results, where the fitness function is associated to the classification and reduction rates. In this paper, we propose a set of methods called evolutionary undersampling that take into consideration the nature of the problem and use different fitness functions for getting a good trade-off between balance of distribution of classes and performance. The study includes a taxonomy of the approaches and an overall comparison among our models and state of the art undersampling methods. The results have been contrasted by using nonparametric statistical procedures and show that evolutionary undersampling outperforms the nonevolutionary models when the degree of imbalance is increased.
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
A Simple Sequentially Rejective Multiple Test Procedure
(1979) · Scandinavian Journal of Statistics · doi:10.2307/4615733 · Cited by 21,526
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
Handbook of Parametric and Nonparametric Statistical Procedures
(2004) · Technometrics · doi:10.1198/tech.2004.s209 · Cited by 4,661
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
Scandinavian Journal of Statistics
Rosén, B. (2005) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess2351.pub2 · Cited by 3,595
Addressing the Curse of Imbalanced Training Sets: One-Sided Selection.
Kubát, M., & Matwin, S. (1997) · Cited by 2,230
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
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
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 condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
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
Reduction Techniques for Instance-Based Learning Algorithms
Wilson, D. R., & Martinez, T. R. (2000) · Machine Learning · doi:10.1023/a:1007626913721 · Cited by 1,182
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
Approximations of the critical region of the fbietkan statistic
Iman, R. L., & Davenport, J. M. (1980) · Communications in Statistics - Theory and Methods · doi:10.1080/03610928008827904 · Cited by 1,125
(1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309452 · Cited by 1,078
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Eshelman, L. J. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50020-3 · Cited by 1,040
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
Feature selection based on rough sets and particle swarm optimization
Wang, X., Yang, J., Teng, X., Xia, W., & Jensen, R. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.09.003 · Cited by 837
Improving Identification of Difficult Small Classes by Balancing Class Distribution
Laurikkala, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-48229-6_9 · Cited by 748
Complexity measures of supervised classification problems
Ho, T. K., & Basu, M. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990132 · Cited by 734
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
Strategies for learning in class imbalance problems
Barandela, R., Sánchez, J. S., Garcı́a, V, & Rangel, E. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00257-1 · Cited by 579
Bernadó-Mansilla, E., & Garrell-Guiu, J. M. (2003) · Evolutionary Computation · doi:10.1162/106365603322365289 · Cited by 357
Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study
Cano, J. R., Herrera, F., & Lozano, M. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819265 · Cited by 332
Self-citationCombating imbalance in network intrusion datasets
Cieslak, D. A., Chawla, N. V., & Striegel, A. (2006) · 2006 IEEE International Conference on Granular Computing · doi:10.1109/grc.2006.1635905 · Cited by 286
Learning from imbalanced data in surveillance of nosocomial infection
Cohen, G., Hilario, M., Sax, H., Hugonnet, S., & Geissbuhler, A. (2006) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2005.03.002 · Cited by 258
Under-Sampling Approaches for Improving Prediction of the Minority Class in an Imbalanced Dataset
Yen, S.-J., & Lee, Y. (2006) · Springer eBooks · doi:10.1007/11816492_89 · Cited by 214
Nearest prototype classification: clustering, genetic algorithms, or random search?
Kuncheva, L. I., & Bezdek, J. C. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.661099 · Cited by 214
Luengo, J., Fernández, A., García, S., & Herrera, F. (2011) · Soft Computing · doi:10.1007/s00500-010-0625-8 · Cited by 191
Self-citationTraining Genetic Programming on Half a Million Patterns: An Example From Anomaly Detection
Song, D., Heywood, M. I., & Zincir-Heywood, N. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.841683 · Cited by 160
Alcalá, R., Alcalá‐Fdez, J., Herrera, F., & Otero, J. (2006) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2006.02.007 · Cited by 121
Self-citationCano, J.-R., Herrera, F., & Lozano, M. (2006) · Data & Knowledge Engineering · doi:10.1016/j.datak.2006.01.008 · Cited by 119
Self-citationStratification for scaling up evolutionary prototype selection
Cano, J.-R., Herrera, F., & Lozano, M. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.09.043 · Cited by 116
Self-citationThe effect of imbalanced data sets on LDA: A theoretical and empirical analysis
Xie, J., & Qiu, Z. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2006.01.009 · Cited by 106
Feature-based image registration by means of the CHC evolutionary algorithm
Cordón, Ó., Damas, S., & Santamaría, J. (2006) · Image and Vision Computing · doi:10.1016/j.imavis.2006.02.002 · Cited by 65
Facetwise Analysis of XCS for Problems With Class Imbalances
Orriols-Puig, A., Bernadó-Mansilla, E., Goldberg, D. E., Sastry, K., & Lanzi, P. L. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2019829 · Cited by 59
Automated Global Structure Extraction for Effective Local Building Block Processing in XCS
Butz, M. V., Pelikán, M., Llorà, X., & Goldberg, D. E. (2006) · Evolutionary Computation · doi:10.1162/evco.2006.14.3.345 · Cited by 58
Yoon, K., & Kwek, S. S. (2005) · International Conference on Hybrid Intelligent Systems (HIS) · doi:10.1109/ichis.2005.23 · Cited by 52
Imbalanced learning with a biased minimax probability machine
Huang, K., Yang, H., King, I., & Lyu, M. R.-T. (2006) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2006.870610 · Cited by 52
Bounding XCS's parameters for unbalanced datasets
Orriols-Puig, A., & Bernadó-Mansilla, E. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144250 · Cited by 43
DIAGNOSE EFFECTIVE EVOLUTIONARY PROTOTYPE SELECTION USING AN OVERLAPPING MEASURE
García, S., Cano, J.-R., Bernadó-Mansilla, E., & Herrera, F. (2009) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001409007727 · Cited by 26
Self-citationA Proposal of Evolutionary Prototype Selection for Class Imbalance Problems
García, S., Cano, J.-R., Fernández, A., & Herrera, F. (2006) · Lecture notes in computer science · doi:10.1007/11875581_168 · Cited by 20
Self-citationA Study of Structural and Parametric Learning in XCS
Kovacs, T., & Kerber, M. (2006) · Evolutionary Computation · doi:10.1162/106365606776022760 · Cited by 9
Cited by
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
Self-citationA 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
A survey on addressing high-class imbalance in big data
Leevy, J. L., Khoshgoftaar, T. M., Bauder, R. A., & Seliya, N. (2018) · Journal of Big Data · doi:10.1186/s40537-018-0151-6 · Cited by 759
Elreedy, D., & Atiya, A. F. (2019) · Information Sciences · doi:10.1016/j.ins.2019.07.070 · Cited by 756
Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study
Garcia, S., Derrac, J., Cano, J. R., & Herrera, F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.142 · Cited by 695
Self-citation
Metadata
- Authors
- García, S., & Herrera, F.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2009-09
- Volume
- 17
- Issue
- 3
- Pages
- 275-306
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W1974079881
- Cited by
- 414
- References
- 47
- FWCI
- 14.82
- 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.