A travel customer segmentation method based on improved RFM and k-means++

Shao-Luo Huang, Shengyi Qin, Xiaoxiao Jiang, Yi Cao
{"title":"A travel customer segmentation method based on improved RFM and k-means++","authors":"Shao-Luo Huang, Shengyi Qin, Xiaoxiao Jiang, Yi Cao","doi":"10.1145/3569966.3570085","DOIUrl":null,"url":null,"abstract":"Customer segmentation is an important approach for customer relationship management, in which many methods are achieved by the Recency, Frequency and Monetary model(RFM) and clustering techniques. However, most methods based on the Recency, Frequency and Monetary model do not consider customer loyalty. In addition, these methods need to use all the historical data when updating the clustering, which has high data storage requirements. In this paper, a clustering method with a time window is proposed to solve these problems. The proposed method is divided into a feature selection stage and a clustering stage. In the feature selection stage, an important factor is considered in an improved Recency, Frequency and Monetary model, called the Length, Recency, Frequency and Monetary model(LRFM). In the clustering stage, a sliding time window is added to intercept the most recent data before the clustering. The proposed method differs from many other methods in that the model takes into consideration a new feature Length to identify customers more accurately, and uses the sliding time window to reduce data storage requirements. Based on the proposed method, the travel customer value analysis is explored on real customer anonymous transaction data. The experimental results show that the proposed method can classify travel customers into different groups effectively. The proposed method has a better clustering performance compared to other baseline algorithms.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3569966.3570085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Customer segmentation is an important approach for customer relationship management, in which many methods are achieved by the Recency, Frequency and Monetary model(RFM) and clustering techniques. However, most methods based on the Recency, Frequency and Monetary model do not consider customer loyalty. In addition, these methods need to use all the historical data when updating the clustering, which has high data storage requirements. In this paper, a clustering method with a time window is proposed to solve these problems. The proposed method is divided into a feature selection stage and a clustering stage. In the feature selection stage, an important factor is considered in an improved Recency, Frequency and Monetary model, called the Length, Recency, Frequency and Monetary model(LRFM). In the clustering stage, a sliding time window is added to intercept the most recent data before the clustering. The proposed method differs from many other methods in that the model takes into consideration a new feature Length to identify customers more accurately, and uses the sliding time window to reduce data storage requirements. Based on the proposed method, the travel customer value analysis is explored on real customer anonymous transaction data. The experimental results show that the proposed method can classify travel customers into different groups effectively. The proposed method has a better clustering performance compared to other baseline algorithms.
基于改进RFM和k-means++的旅游客户细分方法
客户细分是客户关系管理的一种重要方法,其中有许多方法是通过最近、频率和货币模型(RFM)和聚类技术实现的。然而,大多数基于最近、频率和货币模型的方法没有考虑客户忠诚度。此外,这些方法在更新聚类时需要使用所有的历史数据,这对数据存储的要求很高。本文提出了一种带时间窗的聚类方法来解决这些问题。该方法分为特征选择阶段和聚类阶段。在特征选择阶段,一个重要的因素被考虑在一个改进的近因、近因、频率和货币模型中,称为长度、近因、频率和货币模型(LRFM)。在聚类阶段,增加了一个滑动时间窗口来截取聚类前的最新数据。该方法与许多其他方法的不同之处在于,该模型考虑了新的特征长度来更准确地识别客户,并使用滑动时间窗口来减少数据存储需求。在此基础上,对真实客户匿名交易数据的旅游客户价值分析进行了探索。实验结果表明,该方法可以有效地将旅游客户划分为不同的群体。与其他基准算法相比,该方法具有更好的聚类性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信