# A novel evolutionary data mining algorithm with applications to churn prediction

Research output: Contribution to journal › Article

## Standard

**A novel evolutionary data mining algorithm with applications to churn prediction.** / Au, WH; Chan, KCC; Yao, Xin.

Research output: Contribution to journal › Article

## Harvard

*IEEE Transactions on Evolutionary Computation*, vol. 7, no. 6, pp. 532-545. https://doi.org/10.1109/TEVC.2003.819264

## APA

*IEEE Transactions on Evolutionary Computation*,

*7*(6), 532-545. https://doi.org/10.1109/TEVC.2003.819264

## Vancouver

## Author

## Bibtex

}

## RIS

TY - JOUR

T1 - A novel evolutionary data mining algorithm with applications to churn prediction

AU - Au, WH

AU - Chan, KCC

AU - Yao, Xin

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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 problem 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 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-order rules (i.e., rules with one conjunct/condition) using a probabilistic induction technique and based on these rules, rules of higher order (two or more conjuncts) are obtained iteratively; 2) when identifying interesting rules, an objective interestingness measure is used; 3) the fitness of a chromosome is defined in terms of the probability that the attribute values of a record can be correctly determined using the rules it encodes; and 4) the likelihood of predictions (or classifications) made are estimated so that subscribers can be ranked according to their likelihood to churn. Experiments with different data sets showed that DMEL is able to effectively discover interesting classification rules. In particular; it is able to predict churn accurately under different churn rates when applied to real telecom subscriber data.

AB - 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 problem 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 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-order rules (i.e., rules with one conjunct/condition) using a probabilistic induction technique and based on these rules, rules of higher order (two or more conjuncts) are obtained iteratively; 2) when identifying interesting rules, an objective interestingness measure is used; 3) the fitness of a chromosome is defined in terms of the probability that the attribute values of a record can be correctly determined using the rules it encodes; and 4) the likelihood of predictions (or classifications) made are estimated so that subscribers can be ranked according to their likelihood to churn. Experiments with different data sets showed that DMEL is able to effectively discover interesting classification rules. In particular; it is able to predict churn accurately under different churn rates when applied to real telecom subscriber data.

KW - data mining

KW - genetic algorithms

KW - evolutionary computation

KW - customer retention

KW - churn prediction

U2 - 10.1109/TEVC.2003.819264

DO - 10.1109/TEVC.2003.819264

M3 - Article

VL - 7

SP - 532

EP - 545

JO - IEEE Transactions on Evolutionary Computation

JF - IEEE Transactions on Evolutionary Computation

SN - 1089-778X

IS - 6

ER -