Customer Clustering Based on RFM Features Using K-Means Algorithm

Wafa Essayem, F. A. Bachtiar, Diah Priharsari
{"title":"Customer Clustering Based on RFM Features Using K-Means Algorithm","authors":"Wafa Essayem, F. A. Bachtiar, Diah Priharsari","doi":"10.1109/CyberneticsCom55287.2022.9865572","DOIUrl":null,"url":null,"abstract":"Offering targeted products and services to customers is the key driver to a successful business. In recent years and with the simplified access and gathering of data, companies are adjusting their marketing strategies to retain and attract new customers. One of the methods organizations adopt, is customer clustering. Customer clustering, as part of Customer Relationship Management, is useful when companies wish to offer services, discounts and targeted advertising campaigns to specific customers based on their preferences. One of the techniques widely used in this task is RFM based clustering using K-Means clustering algorithm. The clusters obtained by the algorithm are then further analyzed to set marketing strategies. In this research we cluster customers of a retail store based on RFM features using K-Means clustering algorithm. For the task, we use the available POS data of the store. Clusters obtained are analyzed using Silhouette analysis technique and compared to the observations in the retail store. We found that one of the clusters indicates possible customer churn while another showed potential loyal customers. These clusters can be used to set special marketing strategies to retain and win back customers.","PeriodicalId":178279,"journal":{"name":"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberneticsCom55287.2022.9865572","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Offering targeted products and services to customers is the key driver to a successful business. In recent years and with the simplified access and gathering of data, companies are adjusting their marketing strategies to retain and attract new customers. One of the methods organizations adopt, is customer clustering. Customer clustering, as part of Customer Relationship Management, is useful when companies wish to offer services, discounts and targeted advertising campaigns to specific customers based on their preferences. One of the techniques widely used in this task is RFM based clustering using K-Means clustering algorithm. The clusters obtained by the algorithm are then further analyzed to set marketing strategies. In this research we cluster customers of a retail store based on RFM features using K-Means clustering algorithm. For the task, we use the available POS data of the store. Clusters obtained are analyzed using Silhouette analysis technique and compared to the observations in the retail store. We found that one of the clusters indicates possible customer churn while another showed potential loyal customers. These clusters can be used to set special marketing strategies to retain and win back customers.
基于K-Means算法的RFM特征客户聚类
为客户提供有针对性的产品和服务是企业成功的关键。近年来,随着数据获取和收集的简化,企业正在调整其营销策略,以留住和吸引新客户。组织采用的方法之一是客户集群。客户集群是客户关系管理的一部分,当公司希望根据特定客户的偏好提供服务、折扣和有针对性的广告活动时,它很有用。在此任务中广泛使用的技术之一是使用K-Means聚类算法的基于RFM的聚类。然后对算法得到的聚类进行进一步分析,以制定营销策略。本研究采用K-Means聚类算法,基于RFM特征对零售商店顾客进行聚类。对于该任务,我们使用商店的可用POS数据。使用剪影分析技术对获得的聚类进行分析,并将其与零售商店的观察结果进行比较。我们发现,其中一个集群表明可能的客户流失,而另一个集群表明潜在的忠诚客户。这些集群可以用来制定特殊的营销策略,以保留和赢回客户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信