The Application of Data Mining Technology in the Customer Churn Prewarning

Abstract:

With the further reform and market division in the telecommunication industry, there are more and more choices for customers to select telecom products and operators, which lead to the fiercer competition for customers between telecom operators. As the technical method to identify customers churn, the data mining can help the telecom competitors to analyze some seemingly unrelated data into meaningful information. On the basis of the research on the vital problems in the telecom companies, this paper explains how to apply data mining techniques to customer churn analysis, proposes the specific procedures and technology solutions to prevent the customer churn and builds the models of the data mining by analyzing the related algorithm. Finally, based on the systematical analysis on theory and method to data mining, the paper draws the conclusion that the customers churn listing and tree algorithm can solve the practical problems of the customer churn in telecommunication industry.

• Periodical: Applied Mechanics and Materials (Volumes 644-650)
• Pages: 2198-2201
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.644-650.2198
• Online since: September 2014
• Authors: Li Chang Zhen, Xin Gao*, Yi Ming Wang, Yong Chun Gao
• Keywords: Algorithm (GA), Customer Churn, Data Mining Technology, Prewarning

References

[1] Norio Katayama , Shin'ichi Satoh, Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information, Proceedings of the 17th International Conference on Data Engineering, pp.493-502, April 02-06, (2010).

DOI: 10.1109/icde.2001.914863

[2] Jiawei Han, Mieheline Kamber. The concept and technology of data mining．200l.

[3] TrevorH, RobertT. Data mining and consequence and prediction. (2004).

[4] Vipin Kumar, Mohammed Zaki. High performance data mining. (2012).

[5] Huo Yingbao, Han Zhijun. The research of customer's honest．2012 (4)：77—80.

[6] Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, Ramasamy Uthurusamy. Advances in Knowledge Discovery and Data Mining. P. 51, April , (1996).

[7] Charu C. Aggarwal, Re-designing distance functions and distance-based applications for high dimensional data, ACM SIGMOD Record, v. 30 n. 1, pp.13-18, March (2011).

DOI: 10.1145/373626.373638

[8] C. C. Aggarwal. Towards Meaningful High Dimensional Nearest Neighbor Search by Human-Computer Interaction. ICDE Conference, (2012).

DOI: 10.1109/icde.2002.994777

[9] Charu C. Aggarwal , Philip S. Yu, The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.119-129.

DOI: 10.1145/347090.347116

[10] C. C. Aggarwal, A. Hinneburg, D. A. Keim. On the Surprising Behavior of Distance Metrics in High Dimensional Space. ICDT Conference, (2011).

DOI: 10.1007/3-540-44503-x_27

[11] D. Bertsekas. Nonlinear Programming. Athena Scientific, 2nd Edition, (2012).

[12] G. Das, H. Mannila. Context-Based Similarity Measures for Categorical Databases. PDKK Conference, (2000).

[13] K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft. When is Nearest Neighbors Meaningful? ICDT Conference, (2011).

[14] S. Deerwester et al. Indexing by Latent Semantic Analysis. Journal of the American Society for Information Science, 41(6): 391-407, (2012).

[15] J. Foote. A Similarity Measure for Automatic Audio Classification. AAI 1997 Spring Symposium on Intelligent Integration and Use of Text, Image, Video, and Audio Corpora, (2012).

[16] Alexander Hinneburg , Charu C. Aggarwal , Daniel A. Keim, What Is the Nearest Neighbor in High Dimensional Spaces?, Proceedings of the 26th International Conference on Very Large Data Bases, pp.506-515, September 10-14, (2000).