{"title":"Churn Prediction Using Mathematical Programming via a Linear Classification Algorithm","authors":"Mohamed Barhdadi, Badreddine Benyacoub, Mohamed Ouzineb","doi":"10.1134/s2070048224700182","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The initial idea in developing customer churn prediction was to use statistical analysis of a sample of previous customers to help operators predict which existing customers were likely migrate to other operators. In this paper, a nonstatistical approach to this problem can also be envisaged by formulating the problem as a linear program. The main concept of our proposed algorithm is to hybridize the Jackknife resampling technique with an efficient heuristic based on a variable neighborhood search algorithm to construct a new approach that can present an alternative to black-box machine learning methods. The goal is to find possible solutions (or weights) to minimize error distances and the number of misclassified points. We tested the suggested algorithm with an imbalanced instance and the comparisons show that the proposed model outperforms the most existing machine learning classifiers, both in terms of the solution quality and the execution time. The numerical results indicate that the best solution is achieved in 85% over G-mean of all instances tested. The average gap between our solution and the best solution is still quite small (1.15%).</p>","PeriodicalId":38050,"journal":{"name":"Mathematical Models and Computer Simulations","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Models and Computer Simulations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/s2070048224700182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
Abstract
The initial idea in developing customer churn prediction was to use statistical analysis of a sample of previous customers to help operators predict which existing customers were likely migrate to other operators. In this paper, a nonstatistical approach to this problem can also be envisaged by formulating the problem as a linear program. The main concept of our proposed algorithm is to hybridize the Jackknife resampling technique with an efficient heuristic based on a variable neighborhood search algorithm to construct a new approach that can present an alternative to black-box machine learning methods. The goal is to find possible solutions (or weights) to minimize error distances and the number of misclassified points. We tested the suggested algorithm with an imbalanced instance and the comparisons show that the proposed model outperforms the most existing machine learning classifiers, both in terms of the solution quality and the execution time. The numerical results indicate that the best solution is achieved in 85% over G-mean of all instances tested. The average gap between our solution and the best solution is still quite small (1.15%).
期刊介绍：
Mathematical Models and Computer Simulations is a journal that publishes high-quality and original articles at the forefront of development of mathematical models, numerical methods, computer-assisted studies in science and engineering with the potential for impact across the sciences, and construction of massively parallel codes for supercomputers. The problem-oriented papers are devoted to various problems including industrial mathematics, numerical simulation in multiscale and multiphysics, materials science, chemistry, economics, social, and life sciences.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
