Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 280))

Abstract

Class imbalance presents significant challenges to customer churn prediction. Most of previous research efforts addressing class imbalance focus on the usage of in-domain information. In fact, due to the development of information technology, customer data of related domains may be gathered. These data come from different time-periods, districts or product categories. In this paper, we develop a new churn prediction model based on transfer learning model, which uses customer data from related domains to address the issue of data imbalance. The new model is applied to a real-world churn prediction problem in the bank industry. The results show that the new model provides better performance than traditional method such as resampling and cost-sensitive learning in dealing with class balance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ascarza E, Hardie BGS (2013) A joint model of usage and churn in contractual settings. Mark Sci 32(4):570–590

    Article  Google Scholar 

  2. Chawla N, Bowyer K et al (2002) Smote: syntheticminority over-sampling technique. J Artif Intell Res 16(3):321–357

    Google Scholar 

  3. Kamishima T, Hamasaki M, Akaho S (2009) TrBagg: a simple transfer learning method and its application to personalization in collaborative tagging. In: Proceeding of 9th IEEE international conference on data mining, Miami, FL, USA, pp 219–228

    Google Scholar 

  4. Lemmens A, Croux C (2006) Bagging and boosting classification trees to predict churn. J Mark Res 43:276–286

    Article  Google Scholar 

  5. Pan S, Yang Q (2010) A survey on transfer learning. IEEE Trans Knowl Data Eng 22(10): 1345–1359

    Google Scholar 

  6. Sun Y, Wong Kamel M (2009) Classification of imbalanced data: a review. Int J Pattern Recognit Artif Intell 23(4):687–719

    Article  Google Scholar 

  7. Verbraken T, Verbeke W, Baesens B (2013) Working with abstracts a novel profit maximizing metric for measuring classification performance. J Mark Res 25(5):961–973

    Google Scholar 

  8. Yang W, Wu X (2006) 10 challenging problems in data mining research. Int J Inf Technol Decis Mak 5(4):597–604

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China (Grant No. 71071101 and No. 71172196) and Scientific Research Starting Foundation for Young Teachers of Sichuan University (2012SCU11013).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bing Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhu, B., Xiao, J., He, C. (2014). A Balanced Transfer Learning Model for Customer Churn Prediction. In: Xu, J., Cruz-Machado, V., Lev, B., Nickel, S. (eds) Proceedings of the Eighth International Conference on Management Science and Engineering Management. Advances in Intelligent Systems and Computing, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55182-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55182-6_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55181-9

  • Online ISBN: 978-3-642-55182-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics