Toward a hybrid data mining model for customer retention

被引:70
作者
Chu, Bong-Horng [1 ,3 ]
Tsai, Ming-Shian [1 ]
Ho, Cheng-Seen [2 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Elect Engn, Taipei 106, Taiwan
[2] Inst Technol, Dept Elect Engn, Taipei 235, Taiwan
[3] Chunghwa Telecom Co Ltd, Telecommun Labs, Taipei 106, Taiwan
关键词
customer relationship management; classification; clustering; self-organizing map;
D O I
10.1016/j.knosys.2006.10.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
The prevention of subscriber churn through customer retention is a core issue of Customer Relationship Management (CRM). By minimizing customer churn a company maximizes its profit. This paper proposes a hybridized architecture to deal with customer retention problems. It does so not only through predicting churn probability but also by proposing retention policies. The architecture works in two modes: learning and usage. In the learning mode, the churn model learner seeks potential associations from the subscriber database. This historical information is used to form a churn model. This mode also calls for a policy model constructor to use the attributes identified in the churn model to divide all 'churners' into distinct groups. The policy model constructor is also responsible for developing a policy model for each churner group. In the usage mode, a churn predictor uses the churn model to predict the churn probability of a given subscriber. When the churn model finds that the subscriber has a high churn probability the policy model is used to suggest specific retention policies. This study's experiments show that the churn model has an evaluation accuracy of approximately eighty-five percent. This suggests that policy model construction represents an interesting and important technique in investigating the characteristics of churner groups. Furthermore, this study indicates that understanding the relationships between churns is essential in creating effective retention policy models for dealing with 'churners'. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:703 / 718
页数:16
相关论文
共 19 条
[1]
*AND CONS, 2000, BATTL CHURN INCR SHA
[2]
Bounsaythip C., 2001, OVERVIEW DATA MINING
[3]
CARDELL NS, 2003, CHURN MODELLING MOBI
[4]
CHU BH, 2006, P 19 INT C IND ENG A, P1259
[5]
Uncovering hierarchical structure in data using the growing hierarchical self-organizing map [J].
Dittenbach, M ;
Rauber, A ;
Merkl, D .
NEUROCOMPUTING, 2002, 48 :199-216
[6]
The growing hierarchical self-organizing map [J].
Dittenbach, M ;
Merkl, D ;
Rauber, A .
IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL VI, 2000, :15-19
[7]
DITTTENBACH M, 2000, GROWING SELF ORGANIZ
[8]
Customer retention, loyalty, and satisfaction in the German mobile cellular telecommunications market [J].
Gerpott, TJ ;
Rams, W ;
Schindler, A .
TELECOMMUNICATIONS POLICY, 2001, 25 (04) :249-269
[9]
HOWLETT D, 2000, BOARDWATCH MAGAZINE, V3, P23
[10]
KAMBER M, 2000, DATA MINING CONCEPTS