Profit Driven Decision Trees for Churn Prediction
Sebastiaan H\"oppner, Eugen Stripling, Bart Baesens, Seppe vanden, Broucke, Tim Verdonck

TL;DR
This paper introduces ProfTree, a profit-driven decision tree classifier that integrates profit maximization directly into the model construction process, improving profitability in customer churn prediction over traditional accuracy-based methods.
Contribution
The paper presents ProfTree, a novel evolutionary algorithm-based decision tree method that optimizes for profit using the EMPC metric, aligning model selection with business goals.
Findings
ProfTree significantly outperforms traditional accuracy-based models in profit metrics.
The method demonstrates improved profitability across various real-world telecom datasets.
ProfTree offers an interpretable model aligned with business objectives.
Abstract
Customer retention campaigns increasingly rely on predictive models to detect potential churners in a vast customer base. From the perspective of machine learning, the task of predicting customer churn can be presented as a binary classification problem. Using data on historic behavior, classification algorithms are built with the purpose of accurately predicting the probability of a customer defecting. The predictive churn models are then commonly selected based on accuracy related performance measures such as the area under the ROC curve (AUC). However, these models are often not well aligned with the core business requirement of profit maximization, in the sense that, the models fail to take into account not only misclassification costs, but also the benefits originating from a correct classification. Therefore, the aim is to construct churn prediction models that are profitable and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
