Random Forest-based Approach for Classifying Customers in Social CRM

S. Lamrhari, Hamid Elghazi, Abdellatif El Faker
{"title":"Random Forest-based Approach for Classifying Customers in Social CRM","authors":"S. Lamrhari, Hamid Elghazi, Abdellatif El Faker","doi":"10.1109/ICTMOD49425.2020.9380602","DOIUrl":null,"url":null,"abstract":"Social Customer Relationship Management (social CRM) has become one of the central points for many companies seeking to improve their customer experience. It comprises a set of processes that allows decision-makers to analyze customer data in order to launch an efficient customer-centric and cost-effective marketing strategy. However, targeting all potential customers with one general marketing strategy seems to be inefficient. While targeting each potential customer with a specific strategy can be cost demanding. Thus, it is essential to group customers into specific classes and target each class according to its respective customer needs. In this paper, we develop a Random Forest- based approach to classify potential customers into three main categories namely, prospects, satisfied and unsatisfied customers. The proposed model has been trained, tested, and compared to some state-of-the-art classifiers viz., Artificial Neural Network (ANN), Support Vector Machine (SVM), and K-Nearest Neighbor (KNN) based on several metrics including accuracy, sensitivity, specificity, false positive rate, and false negative rate. The reported results were satisfactory with an accuracy of 98.46%, a sensitivity of 97.69%, and a specificity of 98.84%.","PeriodicalId":158303,"journal":{"name":"2020 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTMOD49425.2020.9380602","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Social Customer Relationship Management (social CRM) has become one of the central points for many companies seeking to improve their customer experience. It comprises a set of processes that allows decision-makers to analyze customer data in order to launch an efficient customer-centric and cost-effective marketing strategy. However, targeting all potential customers with one general marketing strategy seems to be inefficient. While targeting each potential customer with a specific strategy can be cost demanding. Thus, it is essential to group customers into specific classes and target each class according to its respective customer needs. In this paper, we develop a Random Forest- based approach to classify potential customers into three main categories namely, prospects, satisfied and unsatisfied customers. The proposed model has been trained, tested, and compared to some state-of-the-art classifiers viz., Artificial Neural Network (ANN), Support Vector Machine (SVM), and K-Nearest Neighbor (KNN) based on several metrics including accuracy, sensitivity, specificity, false positive rate, and false negative rate. The reported results were satisfactory with an accuracy of 98.46%, a sensitivity of 97.69%, and a specificity of 98.84%.
基于随机森林的社会化CRM客户分类方法
社交客户关系管理(Social Customer Relationship Management,简称Social CRM)已经成为许多公司寻求改善客户体验的中心问题之一。它包括一组流程,使决策者能够分析客户数据,以便推出有效的以客户为中心和具有成本效益的营销策略。然而,用一个通用的营销策略瞄准所有潜在客户似乎是低效的。虽然用特定的策略瞄准每个潜在客户可能需要花费大量的成本。因此,必须将客户划分为特定的类别,并根据各自的客户需求定位每一类。在本文中,我们开发了一种基于随机森林的方法,将潜在客户分为三大类,即潜在客户、满意客户和不满意客户。所提出的模型已经经过训练、测试,并与一些最先进的分类器进行了比较,即人工神经网络(ANN)、支持向量机(SVM)和k近邻(KNN),这些分类器基于几个指标,包括准确性、灵敏度、特异性、假阳性率和假阴性率。结果满意,准确率为98.46%,灵敏度为97.69%,特异性为98.84%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信