Customer Segmentation with RFM Model using Fuzzy C-Means and Genetic Programming

A. Syaifudin, Purwanto Purwanto, Heribertus Himawan, M. Soeleman
{"title":"Customer Segmentation with RFM Model using Fuzzy C-Means and Genetic Programming","authors":"A. Syaifudin, Purwanto Purwanto, Heribertus Himawan, M. Soeleman","doi":"10.30812/matrik.v22i2.2408","DOIUrl":null,"url":null,"abstract":"One of the strategies a company uses to retain its customers is Customer Relationship Management (CRM). CRM manages interactions and supports business strategies to build mutually beneficial relationships between companies and customers. The utilization of information technology, such as data mining used to manage the data, is critical in order to be able to find out patterns made by customers when processing transactions. Clustering techniques are possible in data mining to find out the patterns generated from customer transaction data. Fuzzy C-Means (FCM) is one of the best-known and most widely used fuzzy grouping methods. The iteration process is carried out to determine which data is in the right cluster based on the objective function. The local minimum is the condition where the resulting value is not the lowest value from the solution set. This research aims to solve the minimum local problem in the FCM algorithm using Genetic Programming (GP), which is one of the evolution-based algorithms to produce better data clusters. The result of the research is to compare the application of fuzzy c-means (FCM) and genetic programming fuzzy c-means (GP-FCM) for customer segmentation applied to the Cahaya Estetika clinic dataset. The test results of the GP-FCM yielded an objective function of 20.3091, while for the FCM algorithm, it was 32.44741. Furthermore, evaluating cluster validity using Partition Coefficient (PC), Classification Entropy (CE), and Silhouette Index proves that the results of cluster quality from gp-fcm are more optimal than fcm. The results of this study indicate that the application of genetic programming in the fuzzy c-means algorithm produces more optimal cluster quality than the fuzzy c-means algorithm.","PeriodicalId":364657,"journal":{"name":"MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30812/matrik.v22i2.2408","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the strategies a company uses to retain its customers is Customer Relationship Management (CRM). CRM manages interactions and supports business strategies to build mutually beneficial relationships between companies and customers. The utilization of information technology, such as data mining used to manage the data, is critical in order to be able to find out patterns made by customers when processing transactions. Clustering techniques are possible in data mining to find out the patterns generated from customer transaction data. Fuzzy C-Means (FCM) is one of the best-known and most widely used fuzzy grouping methods. The iteration process is carried out to determine which data is in the right cluster based on the objective function. The local minimum is the condition where the resulting value is not the lowest value from the solution set. This research aims to solve the minimum local problem in the FCM algorithm using Genetic Programming (GP), which is one of the evolution-based algorithms to produce better data clusters. The result of the research is to compare the application of fuzzy c-means (FCM) and genetic programming fuzzy c-means (GP-FCM) for customer segmentation applied to the Cahaya Estetika clinic dataset. The test results of the GP-FCM yielded an objective function of 20.3091, while for the FCM algorithm, it was 32.44741. Furthermore, evaluating cluster validity using Partition Coefficient (PC), Classification Entropy (CE), and Silhouette Index proves that the results of cluster quality from gp-fcm are more optimal than fcm. The results of this study indicate that the application of genetic programming in the fuzzy c-means algorithm produces more optimal cluster quality than the fuzzy c-means algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模糊c均值和遗传规划的RFM客户细分模型
公司用来留住客户的策略之一是客户关系管理(CRM)。客户关系管理管理互动和支持业务战略,以建立公司和客户之间互利的关系。利用信息技术(例如用于管理数据的数据挖掘)是关键,以便能够在处理事务时找出客户所创建的模式。聚类技术可以在数据挖掘中发现客户事务数据生成的模式。模糊c均值(Fuzzy C-Means, FCM)是最著名、应用最广泛的模糊分组方法之一。迭代过程根据目标函数确定哪些数据在正确的聚类中。局部最小值是结果值不是解决方案集中的最低值的条件。遗传规划(Genetic Programming, GP)是一种基于进化的算法,可以产生更好的数据聚类,本研究旨在利用遗传规划(Genetic Programming, GP)解决FCM算法中的最小局部问题。研究的结果是比较模糊c-均值(FCM)和遗传规划模糊c-均值(GP-FCM)在Cahaya Estetika诊所数据集客户细分中的应用。GP-FCM算法的目标函数测试结果为20.3091,FCM算法的目标函数测试结果为32.44741。此外,利用分割系数(PC)、分类熵(CE)和剪影指数(Silhouette Index)对聚类有效性进行评价,证明gp-fcm的聚类质量结果比fcm更优。研究结果表明,遗传规划在模糊c-均值算法中的应用比模糊c-均值算法产生更优的聚类质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementation of Port Knocking with Telegram Notifications to Protect Against Scanner Vulnerabilities Intelligent System for Internet of Things-Based Building Fire Safety with Naive Bayes Algorithm Detecting Disaster Trending Topics on Indonesian Tweets Using BNgram Electronic Tourism Using Decision Support Systems to Optimize the Trips Optimizing Inventory with Frequent Pattern Growth Algorithm for Small and Medium Enterprises
×
引用
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