Customer Segmentation Using the Integration of the Recency Frequency Monetary Model and the K-Means Cluster Algorithm

A. Alamsyah, P. Prasetyo, S. Sunyoto, S. H. Bintari, Danang Dwi Saputro, Shohihatur Rohman, Rizka Nur Pratama
{"title":"Customer Segmentation Using the Integration of the Recency Frequency Monetary Model and the K-Means Cluster Algorithm","authors":"A. Alamsyah, P. Prasetyo, S. Sunyoto, S. H. Bintari, Danang Dwi Saputro, Shohihatur Rohman, Rizka Nur Pratama","doi":"10.15294/sji.v9i2.39437","DOIUrl":null,"url":null,"abstract":"Purpose: This research aims to do customer segmentation in retail companies by implementing the Recency Frequency Monetary (RFM) K-Means cluster model and algorithm optimized by the Elbow method.Methods: This study uses several methods. The RFM model method was chosen to segment customers because it is one of the optimal methods for segmenting customers. The K-Means cluster algorithm method was chosen because it is easy to interpret, implement, fast in convergence, and adapt, but lacks sensitivity to the initial partitioning of the number of clusters. To help classify each category of customers and know the level of loyalty, they use a combination of the RFM model and the K-Means method. The Elbow method is used to improve the performance of the K-Means algorithm by correcting the weakness of the K-Means algorithm, which helps to choose the optimal k value to be used when clustering.Result: This research produces customer segmentation 3 clusters with a Sum of Square Error (SSE) value of 25,829.39 and a Callinski-Harabaz Index (CHI) value of 36,625.89. The SSE and CHI values are the largest ones, so they are the optimal cluster values.Novelty: The application of the integrated RFM model and the K-Means cluster algorithm optimized by the Elbow method can be used as a method for customer segmentation.","PeriodicalId":30781,"journal":{"name":"Scientific Journal of Informatics","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientific Journal of Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15294/sji.v9i2.39437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Purpose: This research aims to do customer segmentation in retail companies by implementing the Recency Frequency Monetary (RFM) K-Means cluster model and algorithm optimized by the Elbow method.Methods: This study uses several methods. The RFM model method was chosen to segment customers because it is one of the optimal methods for segmenting customers. The K-Means cluster algorithm method was chosen because it is easy to interpret, implement, fast in convergence, and adapt, but lacks sensitivity to the initial partitioning of the number of clusters. To help classify each category of customers and know the level of loyalty, they use a combination of the RFM model and the K-Means method. The Elbow method is used to improve the performance of the K-Means algorithm by correcting the weakness of the K-Means algorithm, which helps to choose the optimal k value to be used when clustering.Result: This research produces customer segmentation 3 clusters with a Sum of Square Error (SSE) value of 25,829.39 and a Callinski-Harabaz Index (CHI) value of 36,625.89. The SSE and CHI values are the largest ones, so they are the optimal cluster values.Novelty: The application of the integrated RFM model and the K-Means cluster algorithm optimized by the Elbow method can be used as a method for customer segmentation.
基于频率货币模型和k均值聚类算法的客户细分
目的:本研究旨在通过实施RFM K-Means聚类模型和肘部方法优化的算法,对零售企业进行客户细分。方法:本研究采用多种方法。选择RFM模型方法进行客户细分,因为它是客户细分的最优方法之一。选择K-Means聚类算法方法,因为它易于解释、实现、收敛速度快、适应性强,但对聚类数量的初始划分缺乏敏感性。为了帮助对每一类客户进行分类并了解忠诚度水平,他们使用了RFM模型和K-Means方法的组合。肘部方法通过修正k - means算法的弱点来提高k - means算法的性能,有助于在聚类时选择最优的k值。结果:本研究得到3个客户细分集群,其平方和误差(SSE)值为25,829.39,Callinski-Harabaz指数(CHI)值为36,625.89。SSE和CHI值最大,是最优聚类值。新颖性:应用集成RFM模型和肘部方法优化的K-Means聚类算法,可以作为客户细分的一种方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
13
审稿时长
24 weeks
×
引用
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学术官方微信