Scholay

学术搜索 · AI 审稿 · LaTeX 协作

Fast RFM Analysis in Sequence Data

作者:Yanxin Zheng, Wensheng Gan, Zefeng Chen, Pinlyu Zhou, Xiangxiao Diao · 年份:2023 · DOI:10.1109/icpads60453.2023.00081 · 被引用次数:4 · 研究领域:Algorithms and Data Compression

In recent years, data mining technology has been thriving and is capable of being well applied to e-commerce. In customer relationship management (CRM), the RFM analysis model is one of the most effective approaches to ensure that major enterprises obtain more profits. However, with the rapid development of e-commerce, the diversity and abundance of e-commerce data pose a challenge to mining efficiency. Moreover, in actual market transactions, there is a chronological order of transactions. To address these challenges, we have developed an effective algorithm called SeqRFM, combining sequential pattern mining (SPM) with RFM models. SeqRFM contributes to the customer’s recency (R), frequency (F), and monetary (M) scores to represent the significance of the customers and identifies the sequences with high recency, high frequency, and high monetary value. A series of experiments demonstrate the superiority and effectiveness of the algorithm compared to the most advanced RFM algorithms on sequence data. The source code and datasets are available at GitHub: https://github.com/DSI-Lab1/SeqRFM.