Skip to main content
Log in

A Data Mining Approach for Retailing Bank Customer Attrition Analysis

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Deregulation within the financial service industries and the widespread acceptance of new technologies is increasing competition in the finance marketplace. Central to the business strategy of every financial service company is the ability to retain existing customers and reach new prospective customers. Data mining is adopted to play an important role in these efforts. In this paper, we present a data mining approach for analyzing retailing bank customer attrition. We discuss the challenging issues such as highly skewed data, time series data unrolling, leaker field detection etc, and the procedure of a data mining project for the attrition analysis for retailing bank customers. We use lift as a proper measure for attrition analysis and compare the lift of data mining models of decision tree, boosted naïve Bayesian network, selective Bayesian network, neural network and the ensemble of classifiers of the above methods. Some interesting findings are reported. Our research work demonstrates the effectiveness and efficiency of data mining in attrition analysis for retailing bank.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A.M. Hughes, The Complete Database Marketer: Second-generation Strategies and Techniques for Tapping the Power of Your Customer Database, McGraw Hill, 1996.

  2. B. Baesens, M. Egmont-Petersen, R. Castelo, and J. Vanthienen, “Learning Bayesian network classifiers for credit scoring us-ing Markov chain monte Carlo search,” Tech report, Utrecht University, Institute of Information and Computer Science, Netherland.

  3. S. Bhattacharya, “Direct marketing response models using ge-netic algorithms,” in Proc. of the 4th International Conference on Knowledge Discovery and Data Mining, 1998, pp. 144–148.

  4. X. Hu, “Using rough sets theory and database operations to con-struct a good ensemble of classifiers for data mining application,” in Proc. of the 2001 IEEE International Conf. on Data Mining, 2001, pp. 233–240.

  5. F. Provost and T. Fawcett, “Analysis and visualization of classi-fiers performance: Comparison under imprecise class and cost distribution,” in Proc. of the 3rd International Conference on Knowledge Discovery and Data Mining, pp. 43–48.

  6. M.Berry and G. Linoff, Mastering Data Mining: The Art and Science of Customer Relationship Management, John Wiley & Son, 1998.

  7. T. Masters, Neural, Novel & Hybrid Algorithms for Time Series Predictions, John Wiley & Sons Inc, 1995.

  8. N. Indurkhyn and M. Sholom, “Solving regression problems with rule-based ensemble classifiers,” in Proc. of the ACM SIGKDD, 2001, pp. 287–292.

  9. G. Piatetsky-Shapiro and B. Masand, “Estimating campaign benefits and modeling lift,” in Proc. of the 5th SIGKDD Interna-tional Conference on Knowledge Discovery and Data Mining, pp. 185–193.

  10. X. Hu, “Comparison of classification methods for customer attri-tion analysis” in Proc. of the Third International Conference on Rough Sets and Current Trends in Computing, Springer, 2002, pp. 487–492.

  11. C. Ling and C.Li, “Data mining for direct marketing: Prob-lem and solutions,” in Proc. of the 4th International Confer-ence on Knowledge Discovery & Data Mining, 1998, pp. 73–79.

  12. B. Masand and G. Piatetsky-Shapiro, “A comparison of ap-proaches for maximizing business payoff of prediction models,” in Proc. of the 2nd International Conference on Knowledge Dis-covery and Data Mining, 1996, pp. 195–201.

  13. C. Elkan, “Boosted and na¨ý ve bayesian learning,” Technical Re-port No. CS97- 557, University of California, San Diego, Sept. 1997.

    Google Scholar 

  14. M. Klenin, “A simple neural network predictor for volatile time series data nonlinear financial forecasting,” in Proc. of the 4th International Conference on Neural Networks in the Capital Market, 1996, pp. 134–140.

  15. R.E. Schapire, Y. Freund, P. Bartlett, and W.S. Lee, “Boosting the margin: A new explanation for the effectiveness of voting methods,” The Annals of Statistics, toappear.

  16. J.R. Quinlan, “Induction of decision tree,” Machine Learning, vol. 1, no. 1, pp. 81–96.

  17. J.R. Quinlan, “Bagging, boosting, and C4.5.” in Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1996, pp. 725–730.

  18. G. Grudnitski and A. Quang, “Important factors in neural net-works' forecasts of gold futures prices,” in Proc. of the 4th Inter-national Conference on Neural Networks in the Capital Market, 1996, pp. 163–176.

  19. N. Friedman, D. Geiger, and M. Goldszmidt, “Bayesian network classifiers,” Machine Learning,vol. 29, pp. 131–163, 1997.

    Google Scholar 

  20. R.E. Schapire, “The boosting approach to machine learning: An overview,” MSRI Workshop on Nonlinear Estimation and Classification, 2002.

  21. R.E. Schapire, M. Rochery, M. Rahim, and N. Gupta, “Incorpo-rating prior knowledge into boosting,” in Proc. of the Nineteenth International Conference on Machine Learning, 2002.

  22. X. Hu and N. Cercone, “Data mining via discretization, gener-alization and rough set feature selection,” Knowledge and In-formation System: An International Journal,vol. 1, pp. 33–60, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, X. A Data Mining Approach for Retailing Bank Customer Attrition Analysis. Applied Intelligence 22, 47–60 (2005). https://doi.org/10.1023/B:APIN.0000047383.53680.b6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:APIN.0000047383.53680.b6

Navigation