Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 2,794

The DOI matches its Crossref record; 107 of the 107 references it cites were found in a registry or an index.

A Review on Ensembles for the Class Imbalance Problem: Bagging-, Boosting-, and Hybrid-Based Approaches

Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., Herrera, F. · 2012 · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)

Abstract

Classifier learning with data-sets that suffer from imbalanced class distributions is a challenging problem in data mining community. This issue occurs when the number of examples that represent one class is much lower than the ones of the other classes. Its presence in many real-world applications has brought along a growth of attention from researchers. In machine learning, the ensemble of classifiers are known to increase the accuracy of single classifiers by combining several of them, but neither of these learning techniques alone solve the class imbalance problem, to deal with this issue the ensemble learning algorithms have to be designed specifically. In this paper, our aim is to review the state of the art on ensemble techniques in the framework of imbalanced data-sets, with focus on two-class problems. We propose a taxonomy for ensemble-based methods to address the class imbalance where each proposal can be categorized depending on the inner ensemble methodology in which it is based. In addition, we develop a thorough empirical comparison by the consideration of the most significant published approaches, within the families of the taxonomy proposed, to show whether any of them makes a difference. This comparison has shown the good behavior of the simplest approaches which combine random undersampling techniques with bagging or boosting ensembles. In addition, the positive synergy between sampling techniques and bagging has stood out. Furthermore, our results show empirically that ensemble-based algorithms are worthwhile since they outperform the mere use of preprocessing techniques before learning the classifier, therefore justifying the increase of complexity by means of a significant enhancement of the results.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsmcc.2011.2161285

Cites

107 of 107 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 9

  1. 10.1109/TSMCC.2009.2038280 · doi:10.1109/tsmcc.2009.2038280
  2. 10.1109/TSMCC.2010.2052608 · doi:10.1109/tsmcc.2010.2052608
  3. 2004, Special Issue Learning Imbalanced Datasets SIGKDD Explor Newsl
  4. baszczyski, 2010, Rough Sets and Current Trends in Computing (Lecture Notes in Computer Science Series 6086), 148, 10.1007/978-3-642-13529-3_17 · doi:10.1007/978-3-642-13529-3_17
  5. uncu, 2007, Comparison of different strategies of utilizing fuzzy clustering in structure identification, Inf Sci, 177, 5153, 10.1016/j.ins.2007.06.030 · doi:10.1016/j.ins.2007.06.030
  6. liu, 2000, Principles of Data Mining and Knowledge Discovery, 293
  7. 10.2307/2289016 · doi:10.2307/2289016
  8. zhang, 2008, A strategy for attributes selection in cost-sensitive decision trees induction, Proc IEEE 8th Int Conf Comput Inf Technol Workshops, 8
  9. breiman, 1996, Bias variance and arcing classifiers

Cited by

See all 2,794

Metadata

Authors
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F.
Venue
IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
Published
2012-07
Volume
42
Issue
4
Pages
463-484
ISSN
  • 1094-6977 (ISSN-L)
  • 1558-2442
OpenAlex
W2099454382
Cited by
2,794
References
107
FWCI
45.83
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.