Cited by 310Imbalanced Data Classification TechniquesCustomer churn and segmentationMachine Learning and Data Classification

Comparing oversampling techniques to handle the class imbalance problem: a customer churn prediction case study

Open access
Amin, Adnan, Anwar, Sajid, Adnan, Awais, Nawaz, Muhammad, Howard, Newton, Qadir, Junaid, Hawalah, Ahmad, Hussain, Amir·2016·IEEE Access

Abstract

Customer retention is a major issue for various service-based organizations particularly telecom industry, wherein predictive models for observing the behavior of customers are one of the great instruments in customer retention process and inferring the future behavior of the customers. However, the performances of predictive models are greatly affected when the real-world data set is highly imbalanced. A data set is called imbalanced if the samples size from one class is very much smaller or larger than the other classes. The most commonly used technique is over/under sampling for handling the class-imbalance problem (CIP) in various domains. In this paper, we survey six well-known sampling techniques and compare the performances of these key techniques, i.e., mega-trend diffusion function (MTDF), synthetic minority oversampling technique, adaptive synthetic sampling approach, couples top-N reverse k-nearest neighbor, majority weighted minority oversampling technique, and immune centroids oversampling technique. Moreover, this paper also reveals the evaluation of four rules-generation algorithms (the learning from example module, version 2 (LEM2), covering, exhaustive, and genetic algorithms) using publicly available data sets. The empirical results demonstrate that the overall predictive performance of MTDF and rules-generation based on genetic algorithms performed the best as compared with the rest of the evaluated oversampling methods and rule-generation algorithms.

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/access.2016.2619719

Cites

78 of 78 references verified0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • There is not one oversampling technique that always yields the best result.

    “It is clear that there is not one oversampling technique that always yield the best result (Amin et al., 2016).”

    From Data engineering for fraud detection (2021) · cites this paper as Amin et al., 2016

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 81 references couldn’t be matched to a known paper.

Research works printed but not linked: 8

  1. [13]13. N. Japkowicz, ''The class imbalance problem: Significance and strate- gies,'' in Proc. Int. Conf. Artif. Intell., 2000, pp. 1-7.
  2. [24]24. K. Chitra and B. Subashini, ''Customer retention in banking sector using predictive data mining technique,'' in Proc. 5th Int. Conf. Inf. Technol., 2011, pp. 1-4.
  3. [43]43. N. Chawla, N. Japkowicz, and A. Kolcz, ''Special issue on learning from imbalanced datasets,'' ACM SIGKDD Explorations, vol. 6, no. 1, pp. 1-6, 2004.
  4. [51]51. K. P. Satyasree and J. Murthy, ''An exhaustive literature review on class imbalance problem,'' Int. J. Emerg. Trends Technol. Comput. Sci., vol. 2, pp. 109-118, May 2013.
  5. [62]62. Z. Pawlak, ''Rough sets,'' Int. J. Comput. Inf. Sci., vol. 11, no. 5, pp. 341-356, Oct. 1982.
  6. [66]66. H. Nguyen and S. Nguyen, ''Analysis of STULONG data by rough set exploration system (RSES),'' in Proc. ECML/PKDD Workshop, 2003, pp. 71-82.
  7. [73]73. Oct. 2015). KDD'06 Challenge Dataset, accessed on Oct. 15, 2015. [Online]. Available: http://www3.ntu.edu.sg/sce/pakdd2006/
  8. [79]79. M. R. K. Dhurjad and M. S. Banait, ''A survey on oversampling techniques for imbalanced learning,'' Int. J. Appl. Innov. Eng. Manage., vol. 3, no. 1, pp. 279-284, 2014.

Cited by

Sorted by citations

Authors
Amin, A., Anwar, S., Adnan, A., Nawaz, M., Howard, N., Qadir, J., Hawalah, A., & Hussain, A.
Affiliations
  • Institute of Management Sciences Peshawar (PK)
  • University of Oxford (GB)
  • Information Technology University (PK)
  • Taibah University (SA)
  • University of Stirling (GB)
Venue
IEEE Access
Published
2016
Volume
4
Pages
7940-7957
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2540642777
Cited by
310
References
81
Citations by year
2026: 17 · 2025: 37 · 2024: 38 · 2023: 31 · 2022: 45 · 2021: 55 · 2020: 31 · 2019: 28 · 2018: 19 · 2017: 9
FWCI
15.38
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Stirling Online Research Repository (University of Stirling) (submittedVersion, public-domain)
  • Research Output (Edinburgh Napier University) (submittedVersion, cc-by)
  • Edinburgh Napier Research Repository (Edinburgh Napier University) (submittedVersion, other-oa)
Funders
Engineering and Physical Sciences Research Council (EP/M026981/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
  • Social Sciences › Business, Management and Accounting › Marketing › Customer churn and segmentation
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
class imbalance, oversampling, undersampling, customer churn prediction, customer retention, telecom customers, synthetic minority oversampling, ADASYN, reverse k nearest neighbors, rule generation, genetic algorithm, LEM2, covering algorithm, classification performance comparison

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