Computer Science ›› 2016, Vol. 43 ›› Issue (Z11): 585-590.doi: 10.11896/j.issn.1002-137X.2016.11A.133

Previous Articles     Next Articles

Application of Service Bundling in Churn Predict System

ZHANG Zheng-qing, ZHU Yi-jian, BAI Rui-rui, HUANG Yi-qing and YAN Jian-feng   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Customer churn problem is one of the biggest problems that telco operators are faced with,and it need to be solved.For different scenarios,operators have developed many churn prediction systems.Service number bundling means that customers have relations with 3rd-service support companies such as bank,E-commercials,supermarkets etc.during service available period through bundling phone number.After researching,we found that customers will have service number bundling behaviors with kinds of 3rd-service support companies during service available period.These companies will send SMSs to customers at any time.For customers who are about to churn,they will cancel the service bundling gradually.Thus,service bundling feature plays an important role in predicting potential churners.In order to help decision-making manager formulate corresponding customer retention campaigns and drop the churn probability,we developed the churn prediction model with random forest algorithm,and used logistic regression algorithm to reduce service number features.Experiment results show that service number soft bundling can improve the analysis and prediction performance of churn prediction system.

Key words: Customer churn,Random forest,Service bundling,Logistic regression,Churn prediction system

[1] 蒋国瑞,司学峰.基于代价敏感 SVM 的电信客户流失预测研究[J].计算机应用研究,2009,26(2):521-523
[2] Huang B,Kechadi M T,Buckley B.Customer churn prediction in telecommunications[J].Expert Systems with Applications,2012,39(1):1414-1425
[3] Verbeke W,Martens D,Baesens B.Social network analysis for customer churn prediction[J].Applied Soft Computing,2014,14(1):431-446
[4] 罗彬,邵培基,罗尽尧,等.基于预算限制和客户挽留价值最大化的电信客户流失挽留研究[J].管理学报,2012,9(2):280-288
[5] 范波,程久军.用户间多相似度协同过滤推荐算法[J].计算机科学,2012,39(1):23-26
[6] Stripling E,Antonio K,Baesens B,et al.Profit maximizing logistic regression modeling for customer churn prediction[C]∥IEEE International Conference on Data Science and Advanced Analytics (DSAA),2015.IEEE,2015:1-10
[7] Nie G,Rowe W,Zhang L,et al.Credit card churn forecasting by logistic regression and decision tree[J].Expert Systems with Applications,2011,38(12):15273-15285
[8] Bin L,Peiji S,Juan L.Customer churn prediction based on the decision tree in personal handyphone system service[C]∥2007 International Conference on Service Systems and Service Mana-gement.IEEE,2007:1-5
[9] Lu N,Lin H,Lu J,et al.A customer churn prediction model in telecom industry using boosting[J].IEEE Transactions on Industrial Informatics,2014,10(2):1659-1665
[10] Lemmens A,Croux C.Bagging and boosting classification trees to predict churn[J].Journal of Marketing Research,2006,43(2):276-286
[11] Huang Y,Zhu F,Yuan M,et al.Telco churn prediction with big data[C]∥Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data.ACM,2015:607-618
[12] Xie Y,Li X,Ngai E W T,et al.Customer churn prediction using improved balanced random forests[J].Expert Systems with Applications,2009,36(3):5445-5449
[13] Hung S Y,Yen D C,Wang H Y.Applying data mining to telecom churn management[J].Expert Systems with Applications,2006,31(3):515-524
[14] Tsai C F,Lu Y H.Customer churn prediction by hybrid neural networks[J].Expert Systems with Applications,2009,36(10):12547-12553
[15] Farquad M A H,Ravi V,Raju S B.Churn prediction using comprehensible support vector machine:An analytical CRM application[J].Applied Soft Computing,2014,19(2):31-40
[16] Xia G,Jin W,et al.Model of customer churn prediction on support vector machine[J].Systems Engineering-Theory & Practice,2008,28(1):71-77
[17] Breiman L.Random forests[J].Machine Learning,2001,45(1):5-32
[18] 董师师,黄哲学.随机森林理论浅析[J].集成技术,2013,2(1):1-7

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .