IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04273578.html
   My bibliography  Save this paper

Extreme gradient boosting trees with efficient Bayesian optimization for profit-driven customer churn prediction

Author

Listed:
  • Zhenkun Liu

    (NJUPT - Nanjing University of Posts and Telecommunications [Nanjing])

  • Ping Jiang

    (DUFES - Dongbei University of Finance and Economics, Dalian)

  • Koen W. de Bock

    (Audencia Business School, Audencia Recherche - Audencia Business School)

  • Jianzhou Wang

    (MUST - Macau University of Science and Technology)

  • Lifang Zhang

    (NUFE - Nanjing University of Finance and Economics)

  • Xinsong Niu

    (CAS - Chinese Academy of Sciences [Beijing])

Abstract

Customer retention campaigns increasingly rely on predictive analytics to identify potential churners in a customer base. Traditionally, customer churn prediction was dependent on binary classifiers, which are often optimized for accuracy-based performance measures. However, there is a growing consensus that this approach may not always fulfill the critical business objective of profit maximization, as it overlooks the costs of misclassification and the benefits of accurate classification. This study adopts extreme gradient boosting trees to predict profit-driven customer churn. The class weights and other hyperparameters of these trees are optimized using Bayesian methods based on the profit maximization criterion. Empirical analyses are conducted using real datasets obtained from service providers in multiple markets. The empirical results demonstrate that the proposed model yields significantly higher profits than the benchmark models. Bayesian optimization and adjustment of class weights contributed to enhanced model profitability. Furthermore, when optimizing multiple hyperparameters, the computational cost of model optimization is significantly reduced compared with an exhaustive grid search. Additionally, we demonstrate the robustness of the proposed model through a sensitivity analysis employing Bayesian optimization. Using the proposed model, marketing managers can design targeted marketing plans to retain customer groups with a higher likelihood of churning.

Suggested Citation

  • Zhenkun Liu & Ping Jiang & Koen W. de Bock & Jianzhou Wang & Lifang Zhang & Xinsong Niu, 2024. "Extreme gradient boosting trees with efficient Bayesian optimization for profit-driven customer churn prediction," Post-Print hal-04273578, HAL.
  • Handle: RePEc:hal:journl:hal-04273578
    DOI: 10.1016/j.techfore.2023.122945
    Note: View the original document on HAL open archive server: https://hal.science/hal-04273578
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Zhenkun & Zhang, Ying & Abedin, Mohammad Zoynul & Wang, Jianzhou & Yang, Hufang & Gao, Yuyang & Chen, Yinghao, 2024. "Profit-driven fusion framework based on bagging and boosting classifiers for potential purchaser prediction," Journal of Retailing and Consumer Services, Elsevier, vol. 79(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-04273578. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.