保险购买预测的k -划分集成多标签分类器

Jiayu Zhou, Yong Guo, Yanqing Ye, Jiang Jiang
{"title":"保险购买预测的k -划分集成多标签分类器","authors":"Jiayu Zhou, Yong Guo, Yanqing Ye, Jiang Jiang","doi":"10.12783/dtetr/mcaee2020/35091","DOIUrl":null,"url":null,"abstract":"Individual insurance purchase prediction can help effectively and accurately advertise to maximize sales. Most current insurance purchase prediction model only considers whether a customer will buy certain insurance. In this way, the prediction will be time-consuming with the rapid growth of the number of insurance products. In order to provide more effective and efficient marketing methods for insurance companies, this work proposes a K-Partition Ensemble Multi-Label classification model to predict the customer’s possible future insurance purchase. First, by transforming the insurance purchase prediction problem into a multi-label classification problem, the balance between features and labels of data division in the insurance purchasing dataset is explored. Second, a k-partition ensemble multi-label classification model is introduced, where each distinct label constitutes in the training set as a new category of a single-label classification task, and the random forest is used for multi-class classification. The empirical test is carried out using the Insurance Company Case data from CoIL Challenge 2000. We find prediction classifiers perform the best when the number of labels is around 20. Empirical evidence indicates that our model manages to improve substantially over other 3 classical multi-label classification algorithms with relatively little time, especially in domains with a large number of labels. The research results also provide a new idea and useful reference for the application in specific fields construction of data models based on the multi-label evaluation.","PeriodicalId":11264,"journal":{"name":"DEStech Transactions on Engineering and Technology Research","volume":"32 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"K-Partition Ensemble Multi-label Classifier for Insurance Purchase Prediction\",\"authors\":\"Jiayu Zhou, Yong Guo, Yanqing Ye, Jiang Jiang\",\"doi\":\"10.12783/dtetr/mcaee2020/35091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Individual insurance purchase prediction can help effectively and accurately advertise to maximize sales. Most current insurance purchase prediction model only considers whether a customer will buy certain insurance. In this way, the prediction will be time-consuming with the rapid growth of the number of insurance products. In order to provide more effective and efficient marketing methods for insurance companies, this work proposes a K-Partition Ensemble Multi-Label classification model to predict the customer’s possible future insurance purchase. First, by transforming the insurance purchase prediction problem into a multi-label classification problem, the balance between features and labels of data division in the insurance purchasing dataset is explored. Second, a k-partition ensemble multi-label classification model is introduced, where each distinct label constitutes in the training set as a new category of a single-label classification task, and the random forest is used for multi-class classification. The empirical test is carried out using the Insurance Company Case data from CoIL Challenge 2000. We find prediction classifiers perform the best when the number of labels is around 20. Empirical evidence indicates that our model manages to improve substantially over other 3 classical multi-label classification algorithms with relatively little time, especially in domains with a large number of labels. The research results also provide a new idea and useful reference for the application in specific fields construction of data models based on the multi-label evaluation.\",\"PeriodicalId\":11264,\"journal\":{\"name\":\"DEStech Transactions on Engineering and Technology Research\",\"volume\":\"32 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DEStech Transactions on Engineering and Technology Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12783/dtetr/mcaee2020/35091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DEStech Transactions on Engineering and Technology Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12783/dtetr/mcaee2020/35091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

个人保险购买预测可以帮助有效、准确地进行广告宣传,实现销售最大化。目前大多数保险购买预测模型只考虑客户是否会购买某种保险。这样,随着保险产品数量的快速增长,预测将非常耗时。为了给保险公司提供更有效和高效的营销方法,本文提出了一个K-Partition Ensemble Multi-Label分类模型来预测客户未来可能的保险购买行为。首先,通过将保险购买预测问题转化为多标签分类问题,探索保险购买数据集中数据划分的特征与标签之间的平衡;其次,引入k划分集成多标签分类模型,其中每个不同的标签在训练集中构成一个单标签分类任务的新类别,并使用随机森林进行多类分类。实证检验采用线圈挑战2000年的保险公司案例数据。我们发现,当标签数量在20左右时,预测分类器的表现最好。经验证据表明,与其他3种经典多标签分类算法相比,我们的模型在相对较少的时间内取得了实质性的改进,特别是在标签数量较多的领域。研究结果也为基于多标签评价的数据模型构建在特定领域的应用提供了新的思路和有益的参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
K-Partition Ensemble Multi-label Classifier for Insurance Purchase Prediction
Individual insurance purchase prediction can help effectively and accurately advertise to maximize sales. Most current insurance purchase prediction model only considers whether a customer will buy certain insurance. In this way, the prediction will be time-consuming with the rapid growth of the number of insurance products. In order to provide more effective and efficient marketing methods for insurance companies, this work proposes a K-Partition Ensemble Multi-Label classification model to predict the customer’s possible future insurance purchase. First, by transforming the insurance purchase prediction problem into a multi-label classification problem, the balance between features and labels of data division in the insurance purchasing dataset is explored. Second, a k-partition ensemble multi-label classification model is introduced, where each distinct label constitutes in the training set as a new category of a single-label classification task, and the random forest is used for multi-class classification. The empirical test is carried out using the Insurance Company Case data from CoIL Challenge 2000. We find prediction classifiers perform the best when the number of labels is around 20. Empirical evidence indicates that our model manages to improve substantially over other 3 classical multi-label classification algorithms with relatively little time, especially in domains with a large number of labels. The research results also provide a new idea and useful reference for the application in specific fields construction of data models based on the multi-label evaluation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of Competitiveness of High-Tech Industry in Nanjing Based on Porter Diamond Model Construction and Design of All-Media Digital Textbook Design of 3D Model Database of Substation Equipment Based on Access Software Design of Deicing Device for Air Vent of Cold Storage Evaluating the Collaborative Innovation Performance of Advanced Manufacturing Industry and Modern Service Industry Based on Extension Method
×
引用
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