کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6903077 1446749 2018 31 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Profit maximizing logistic model for customer churn prediction using genetic algorithms
ترجمه فارسی عنوان
مدل لجستیک حداکثر سود را برای پیش بینی تراکم مشتری با استفاده از الگوریتم های ژنتیکی
کلمات کلیدی
داده کاوی، پیش بینی مشتری مدل رگرسیون لجستیک لازو ارزیابی مدل مبتنی بر سود، الگوریتم ژنتیک واقعی،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی
To detect churners in a vast customer base, as is the case with telephone service providers, companies heavily rely on predictive churn models to remain competitive in a saturated market. In previous work, the expected maximum profit measure for customer churn (EMPC) has been proposed in order to determine the most profitable churn model. However, profit concerns are not directly integrated into the model construction. Therefore, we present a classifier, named ProfLogit, that maximizes the EMPC in the training step using a genetic algorithm, where ProfLogit's interior model structure resembles a lasso-regularized logistic model. Additionally, we introduce threshold-independent recall and precision measures based on the expected profit maximizing fraction, which is derived from the EMPC framework. Our proposed technique aims to construct profitable churn models for retention campaigns to satisfy the business requirement of profit maximization. In a benchmark study with nine real-life data sets, ProfLogit exhibits the overall highest, out-of-sample EMPC performance as well as the overall best, profit-based precision and recall values. As a result of the lasso resemblance, ProfLogit also performs a profit-based feature selection in which features are selected that would otherwise be excluded with an accuracy-based measure, which is another noteworthy finding.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Swarm and Evolutionary Computation - Volume 40, June 2018, Pages 116-130
نویسندگان
, , , , ,