一种新的客户流失预测混合分类算法

B. Markapudi, Kunchaparthi Jyothsna Latha, Kavitha Chaduvula
{"title":"一种新的客户流失预测混合分类算法","authors":"B. Markapudi, Kunchaparthi Jyothsna Latha, Kavitha Chaduvula","doi":"10.1109/ICSES52305.2021.9633795","DOIUrl":null,"url":null,"abstract":"Decision trees, support vector machine and gradient boosting are very popular algorithms for predicting the customer churn with good comprehensibility and strong predictive performance. In spite ofall strengths, the decision trees be likely have some problems forholding linear-relations amongthe variables, support vector machine performs marginally better than logistic regression, and gradient boosting givesgreater results when compared with logistic regression, with less development effort. Hencenew hybrid-algorithm, aboosting leaf model (BLM), was proposed forclassifying the data in better way. The basic idea behind this BLM is diverse models was constructed among the segments of data instead of entire dataset thusleads to improved predictive performances how ever observance comprehensibility among those models which constructed on leaves. ThisBLM resides two stages they are one is segmentation and the other one is prediction stages. Inthe first stageby using decision tree segments of customers are identified and second stagemodel wasappliedon each leaf of the tree. This new hybrid-approach was bench-marked compared with decision trees, support leaf model, andlogit leaf model (LLM)regards predictive performance and comprehensibility. The top decile lift (TDL), area under Receiver Operating Characteristics curve (AUC) which used to measure theirpredictive performancesof which BLM marksknowinglyimprovedtheirblocks support vectormachine, decision trees which performs howeverwith advanced ensemble methods logit leaf model.","PeriodicalId":6777,"journal":{"name":"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)","volume":"15 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New hybrid classification algorithm for predicting customer churn\",\"authors\":\"B. Markapudi, Kunchaparthi Jyothsna Latha, Kavitha Chaduvula\",\"doi\":\"10.1109/ICSES52305.2021.9633795\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Decision trees, support vector machine and gradient boosting are very popular algorithms for predicting the customer churn with good comprehensibility and strong predictive performance. In spite ofall strengths, the decision trees be likely have some problems forholding linear-relations amongthe variables, support vector machine performs marginally better than logistic regression, and gradient boosting givesgreater results when compared with logistic regression, with less development effort. Hencenew hybrid-algorithm, aboosting leaf model (BLM), was proposed forclassifying the data in better way. The basic idea behind this BLM is diverse models was constructed among the segments of data instead of entire dataset thusleads to improved predictive performances how ever observance comprehensibility among those models which constructed on leaves. ThisBLM resides two stages they are one is segmentation and the other one is prediction stages. Inthe first stageby using decision tree segments of customers are identified and second stagemodel wasappliedon each leaf of the tree. This new hybrid-approach was bench-marked compared with decision trees, support leaf model, andlogit leaf model (LLM)regards predictive performance and comprehensibility. The top decile lift (TDL), area under Receiver Operating Characteristics curve (AUC) which used to measure theirpredictive performancesof which BLM marksknowinglyimprovedtheirblocks support vectormachine, decision trees which performs howeverwith advanced ensemble methods logit leaf model.\",\"PeriodicalId\":6777,\"journal\":{\"name\":\"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)\",\"volume\":\"15 1\",\"pages\":\"1-4\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSES52305.2021.9633795\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSES52305.2021.9633795","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

决策树、支持向量机和梯度增强是预测客户流失的常用算法,具有较好的可理解性和较强的预测性能。尽管有所有的优势,决策树在保持变量之间的线性关系方面可能存在一些问题,支持向量机的表现略好于逻辑回归,梯度增强与逻辑回归相比效果更好,开发工作量更少。为此,为了更好地对数据进行分类,提出了一种新的混合算法——增强叶模型(boosting leaf model, BLM)。该BLM背后的基本思想是在数据段而不是整个数据集之间构建不同的模型,从而提高了在叶子上构建的模型之间的观察可理解性的预测性能。这个blm分为两个阶段,一个是分割阶段,另一个是预测阶段。在第一阶段,通过使用决策树来识别客户细分,第二阶段在树的每个叶子上应用模型。该方法在预测性能和可理解性方面与决策树、支持叶模型和logit叶模型(LLM)进行了基准比较。顶部十分位升力(TDL)、接收者工作特征曲线下面积(AUC)用于测量BLM标记的预测性能,改进了块支持向量机、决策树(采用先进的集成方法执行logit叶模型)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A New hybrid classification algorithm for predicting customer churn
Decision trees, support vector machine and gradient boosting are very popular algorithms for predicting the customer churn with good comprehensibility and strong predictive performance. In spite ofall strengths, the decision trees be likely have some problems forholding linear-relations amongthe variables, support vector machine performs marginally better than logistic regression, and gradient boosting givesgreater results when compared with logistic regression, with less development effort. Hencenew hybrid-algorithm, aboosting leaf model (BLM), was proposed forclassifying the data in better way. The basic idea behind this BLM is diverse models was constructed among the segments of data instead of entire dataset thusleads to improved predictive performances how ever observance comprehensibility among those models which constructed on leaves. ThisBLM resides two stages they are one is segmentation and the other one is prediction stages. Inthe first stageby using decision tree segments of customers are identified and second stagemodel wasappliedon each leaf of the tree. This new hybrid-approach was bench-marked compared with decision trees, support leaf model, andlogit leaf model (LLM)regards predictive performance and comprehensibility. The top decile lift (TDL), area under Receiver Operating Characteristics curve (AUC) which used to measure theirpredictive performancesof which BLM marksknowinglyimprovedtheirblocks support vectormachine, decision trees which performs howeverwith advanced ensemble methods logit leaf model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MPPT Based Solar PV and Class IV Powered Brushless DC Motor for Water Pump System Forecasting the potential influence of Covid-19 using Data Science and Analytics Asthma, Alzheimer's and Dementia Disease Detection based on Voice Recognition using Multi-Layer Perceptron Algorithm Automatic Speed Controller of Vehicles Using Arduino Board Implementation of Election System Using Blockchain Technology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1