Cited by 348Customer churn and segmentationData Mining Algorithms and ApplicationsData Mining and Machine Learning Applications

A novel evolutionary data mining algorithm with applications to churn prediction

Wai-Ho Au, Chan, K.C.C., Xin Yao·2003·IEEE Transactions on Evolutionary Computation

Abstract

Classification is an important topic in data mining research. Given a set of data records, each of which belongs to one of a number of predefined classes, the classification problem is concerned with the discovery of classification rules that can allow records with unknown class membership to be correctly classified. Many algorithms have been developed to mine large data sets for classification models and they have been shown to be very effective. However, when it comes to determining the likelihood of each classification made, many of them are not designed with such purpose in mind. For this, they are not readily applicable to such problems as churn prediction. For such an application, the goal is not only to predict whether or not a subscriber would switch from one carrier to another, it is also important that the likelihood of the subscriber's doing so be predicted. The reason for this is that a carrier can then choose to provide a special personalized offer and services to those subscribers who are predicted with higher likelihood to churn. Given its importance, we propose a new data mining algorithm, called data mining by evolutionary learning (DMEL), to handle classification problems of which the accuracy of each predictions made has to be estimated. In performing its tasks, DMEL searches through the possible rule space using an evolutionary approach that has the following characteristics: 1) the evolutionary process begins with the generation of an initial set of first…

Integrity signals

Registry

Crossref · 10.1109/tevc.2003.819264

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Lee et al. claimed that in the customer churn prediction competition hosted by the authors, the winning team showed significantly better performance than other teams by utilizing the autoencoder to compress the sparse data.

    “Lee, Eunjo, et al. (2018) claimed that in the customer churn prediction competition hosted by the authors, the winning team showed significantly better performance than other teams by utilizing the autoencoder to compress the sparse data [10].”

    From A Survey on Churn Analysis in Various Business Domains (2020) · cites this paper as [10]

  • Some studies show that short-term prediction and monetary rewards soon leads to another churn.

    “Therefore, some studies show that short-term prediction and monetary rewards soon leads to another churn [10] [45].”

    From A Survey on Churn Analysis in Various Business Domains (2020) · cites this paper as [10]

  • The Deep and Shallow model built by Lee et al. showed excellent churn prediction performance compared to other models.

    “The Deep and Shallow model they built showed excellent churn prediction performance compared to other models.”

    From A Survey on Churn Analysis in Various Business Domains (2020) · cites this paper as [10]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Au, W.-H., Chan, K. C. C., & Yao, X.
Affiliations
  • Hong Kong Polytechnic University (HK)
  • University of Birmingham (GB)
Venue
IEEE Transactions on Evolutionary Computation
Published
2003-12
Volume
7
Issue
6
Pages
532-545
ISSN
1089-778X (ISSN-L)
OpenAlex
W2138906630
Cited by
348
References
2
Citations by year
2026: 2 · 2025: 6 · 2024: 7 · 2023: 8 · 2022: 17 · 2021: 18 · 2020: 10 · 2019: 18 · 2018: 18 · 2017: 16 · 2016: 20 · 2015: 17 · 2014: 15 · 2013: 18 · 2012: 18
FWCI
34.47
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Evolutionary Computation (publishedVersion)
  • PolyU Institutional Research Archive (Hong Kong Polytechnic University) (submittedVersion)
  • University of Birmingham Research Portal (University of Birmingham) (submittedVersion)
Topics
  • Social Sciences › Business, Management and Accounting › Marketing › Customer churn and segmentation
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
Keywords
customer churn prediction, classification rules, rule interestingness measures, customer churn, fitness function

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