Submitted:
03 August 2026
Posted:
04 August 2026
You are already at the latest version
Abstract
Keywords:
1. Introduction

2. Related Work and Research Positioning
2.1. From RFM Segmentation to Predictive Inputs
2.2. Dynamic Customer State and Maintainable Representation
2.3. Multiple Time Horizons and Probability Quality
2.4. Positioning of the Present Study
3. Materials and Methods
3.1. Data Source, Privacy Protection, and Time Isolation
| Window | Cutoff date | Eligible customers | 30-day repurchase | 90-day repurchase | 180-day repurchase |
|---|---|---|---|---|---|
| Training 1 | 2022-10-23 | 2,299 | 17.27% | 22.58% | 34.75% |
| Training 2 | 2023-01-23 | 3,381 | 5.94% | 23.01% | 29.99% |
| Training 3 | 2023-04-23 | 4,839 | 6.90% | 15.33% | 24.41% |
| Training 4 | 2023-07-23 | 5,606 | 5.33% | 15.09% | 28.79% |
| Validation | 2024-01-23 | 7,510 | 6.15% | 17.02% | 24.73% |
| Evaluation | 2024-07-23 | 9,080 | 4.16% | 9.71% | Not mature |
3.2. Dynamic RFM Representation
3.3. Discrete-Interval Hazard Model

3.4. Comparison and Evaluation
3.5. Decision Target and Unit of Analysis
3.6. Event Rules and Reproducible State Construction
3.7. Compact Feature Design
3.8. Ordered Interval Probabilities
3.9. Separation of Learning, Adjustment, and Evaluation
3.10. Evaluation Metrics and Decision-List Measures
4. Results
4.1. Data Profile and Model Comparison

| Feature representation | Dimensions | AUROC | AUPRC | Brier | ECE | Precision at Top 10% |
|---|---|---|---|---|---|---|
| Classical quintile RFM | 3 | 0.7898 | 0.2585 | 0.0824 | 0.0609 | 0.3282 |
| Continuous RFM | 3 | 0.7931 | 0.3058 | 0.0889 | 0.0644 | 0.3601 |
| Dynamic windows | 16 | 0.7959 | 0.3195 | 0.0818 | 0.0538 | 0.3568 |
| E1 without acceleration | 19 | 0.7888 | 0.3070 | 0.0820 | 0.0514 | 0.3425 |
| E1 without gap variables | 18 | 0.7959 | 0.3194 | 0.0818 | 0.0538 | 0.3568 |
| Full E1 | 21 | 0.7888 | 0.3070 | 0.0820 | 0.0514 | 0.3425 |
| DynRFM-Hazard (validation-selected) | 10 | 0.7999 | 0.3230 | 0.0846 | 0.0585 | 0.3667 |
| Full E3 | 28 | 0.7913 | 0.3144 | 0.0810 | 0.0490 | 0.3447 |



4.2. List Efficiency and Calibration
| List size | Customers | Precision | Recall | Lift |
|---|---|---|---|---|
| Top 5% | 454 | 0.4361 | 0.2245 | 4.490 |
| Top 10% | 908 | 0.3667 | 0.3776 | 3.776 |
| Top 20% | 1,816 | 0.2786 | 0.5737 | 2.868 |
| Top 30% | 2,724 | 0.2254 | 0.6961 | 2.320 |



4.3. Retrospective Rolling Temporal Assessment

4.4. Negative Results and Implementation Checks


5. Discussion
5.1. Main Findings and Limitations
5.2. Reading the Reported List Results
5.3. Calibration Monitoring and Drift Response
5.4. Negative Results and Evidence Boundaries
5.5. Scope, Fairness, and Research Governance
6. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
Use of Artificial Intelligence
Abbreviations
| RFM | Recency, Frequency, Monetary |
| AUPRC | Area under the precision-recall curve |
| AUROC | Area under the receiver operating characteristic curve |
| ECE | Expected calibration error |
References
- Rungruang, C.; Riyapan, P.; Intarasit, A.; et al. RFM model customer segmentation based on hierarchical approach using FCA. Expert Syst. With Appl. 2024, 237, 121449. [Google Scholar] [CrossRef]
- Smaili, M.Y.; Hachimi, H. New RFM-D classification model for improving customer analysis and response prediction. Ain Shams Eng. J. 2023, 14(12), 102254. [Google Scholar] [CrossRef]
- Ho, T.; Nguyen, S.; Nguyen, H.; et al. An Extended RFM Model for Customer Behaviour and Demographic Analysis in Retail Industry. Bus. Syst. Res. J. 2023, 14(1), 26–53. [Google Scholar] [CrossRef]
- Chavhan, S.; Dharmik, R.C.; Jain, S.; Kamble, K. RFM analysis for customer segmentation using machine learning: A survey of a decade of research. 3C TIC 2022, 11(2), 166–173. [Google Scholar] [CrossRef]
- Wei, H. Negative Indicators and Ordering Stability in Exploratory Factor Analysis: A Sign-Orientation Theory with Reproducible Simulation Evidence; Preprints, 2026. [Google Scholar] [CrossRef]
- Mena, G.; Coussement, K.; De Bock, K.W.; De Caigny, A.; Lessmann, S. Exploiting time-varying RFM measures for customer churn prediction with deep neural networks. Ann. Oper. Res. 2024, 339(1-2), 765–787. [Google Scholar] [CrossRef]
- Verma, R.; Rathor, D.; Kumar, S.; et al. Enhancing customer repurchase prediction: Integrating classification algorithms with RFM analysis for precision and actionable insights. IIMB Manag. Rev. 2025, 37(2), 100574. [Google Scholar] [CrossRef]
- Irawan, M.I.; Putris, N.A.D.; Muhammad, N. Customer Churn Prediction Using the RFM Approach and Extreme Gradient Boosting for Company Strategy Recommendation. Register 2024, 10(2), 127–140. [Google Scholar] [CrossRef]
- Jajam, N.; Challa, N.P. Dynamic Behavior-Based Churn Forecasts in the Insurance Sector. Comput. Mater. Contin. 2023, 75(1), 977–997. [Google Scholar] [CrossRef]
- Kim, K.C.; Wei, H. Development of a Face Detection and Recognition System Using a Raspberry Pi. J. Korea Inst. Electron. Commun. Sci. 2017, 12(5), 859–864. [Google Scholar] [CrossRef]
- Wei, H. DecorPGNet: Functional Area Division and Layout Algorithm Model in Living Rooms of Chinese Apartment-Style Family Homes. Civ. Eng. Res. J. 2024, 15(1), 555902. [Google Scholar] [CrossRef]
- Wei, H. Exploring and Practicing the Quantification of Interior Design Colors from an IKEA Design Perspective. J. Sens. Netw. Data Commun. 2024, 4(2), 01–12. [Google Scholar] [CrossRef]
- Allison, P.D. Discrete-Time Methods for the Analysis of Event Histories. Sociol. Methodol. 1982, 13, 61–98. [Google Scholar] [CrossRef]
- Tutz, G.; Schmid, M. Modeling Discrete Time-to-Event Data; Springer, 2016. [Google Scholar] [CrossRef]
- Saito, T.; Rehmsmeier, M. The Precision-Recall Plot Is More Informative than the ROC Plot When Evaluating Binary Classifiers on Imbalanced Datasets. PLoS ONE 2015, 10(3), e0118432. [Google Scholar] [CrossRef] [PubMed]
- Davis, J.; Goadrich, M. The relationship between Precision-Recall and ROC curves. Proc. ICML 2006, 233–240. [Google Scholar] [CrossRef]
- Brier, G.W. Verification of forecasts expressed in terms of probability. Mon. Weather Rev. 1950, 78(1), 1–3. [Google Scholar] [CrossRef]
- Vadava, A.G.; Oprea, S.V.; Niculae, A.M.; et al. Improving Churn Detection in the Banking Sector: A Machine Learning Approach with Probability Calibration Techniques. Electronics 2024, 13(22), 4527. [Google Scholar] [CrossRef]
- Wei, H.; Wang, X. Financial Risk Management Early-Warning Model for Chinese Enterprises. J. Risk Financ. Manag. 2024, 17(7), 255. [Google Scholar] [CrossRef]
- Siriudomset, W.; Udomratanamanee, T.; Srising, P.; Tangsophon, S. The role of service fairness, service experience, and customer engagement in driving repurchase intention: Evidence from Thailand’s aesthetic industry. Int. J. Innov. Res. Sci. Stud. 2025, 8(3), 3615–3626. [Google Scholar] [CrossRef]
- Bogaert, M.; Delaere, L. Ensemble Methods in Customer Churn Prediction: A Comparative Analysis of the State-of-the-Art. Mathematics 2023, 11(5), 1137. [Google Scholar] [CrossRef]
- Brito, J.B.G.; Bucco, G.B.; Heldt, R.; et al. A framework to improve churn prediction performance in retail banking. Financ. Innov. 2024, 10(1), 17. [Google Scholar] [CrossRef]
- Ribeiro, H.; Barbosa, B.; Moreira, A.C.; et al. Churn in services - A bibliometric review. Cuad. De Gest. 2022, 22(2), 97–121. [Google Scholar] [CrossRef]
- Zaghloul, M.; Barakat, S.; Rezk, A. Enhancing customer retention in Online Retail through churn prediction: A hybrid RFM, K-means, and deep neural network approach. Expert Syst. With Appl. 2025, 290, 128465. [Google Scholar] [CrossRef]
- Talaat, F.M.; Aljadani, A.; Alharthi, B.; et al. A Mathematical Model for Customer Segmentation Leveraging Deep Learning, Explainable AI, and RFM Analysis in Targeted Marketing. Mathematics 2023, 11(18), 3930. [Google Scholar] [CrossRef]
- Xiahou, X.; Harada, Y. B2C E-Commerce Customer Churn Prediction Based on K-Means and SVM. J. Theor. Appl. Electron. Commer. Res. 2022, 17(2), 458–475. [Google Scholar] [CrossRef]
- Liao, J.; Jantan, A.; Ruan, Y.; Zhou, C. Multi-Behavior RFM Model Based on Improved SOM Neural Network Algorithm for Customer Segmentation. IEEE Access 2022, 10, 122501–122512. [Google Scholar] [CrossRef]
- Chen, A.H.L.; Gunawan, S. Enhancing Retail Transactions: A Data-Driven Recommendation Using Modified RFM Analysis and Association Rules Mining. Appl. Sci. 2023, 13(18), 10057. [Google Scholar] [CrossRef]
- Antonius, V.H.; Fitrianah, D. Enhancing Customer Segmentation Insights by using RFM + Discount Proportion Model with Clustering Algorithms. Int. J. Adv. Comput. Sci. Appl. 2024, 15(3). [Google Scholar] [CrossRef]
- Jajam, N.; Challa, N.P.; Prasanna, K.S.L.; Deepthi, C.H.V.S. Arithmetic Optimization With Ensemble Deep Learning SBLSTM-RNN-IGSA Model for Customer Churn Prediction. IEEE Access. 2023, 11, 93111–93128. [Google Scholar] [CrossRef]
- Suh, Y. Machine learning based customer churn prediction in home appliance rental business. J. Big Data 2023, 10(1), 41. [Google Scholar] [CrossRef] [PubMed]
- Mirabdolbaghi, S.M.; Amiri, B. Model Optimization Analysis of Customer Churn Prediction Using Machine Learning Algorithms with Focus on Feature Reductions. Discret. Dyn. Nat. Soc. 2022, 5134356. [Google Scholar] [CrossRef]
- AbdelAziz, N.M.; Bekheet, M.; Salah, A.; et al. A Comprehensive Evaluation of Machine Learning and Deep Learning Models for Churn Prediction. Information 2025, 16(7), 537. [Google Scholar] [CrossRef]
- Shahabikargar, M.; Beheshti, A.; Zhang, X.; et al. A comprehensive survey on customer churn analysis studies. J. Inf. Telecommun. 2026, 10(1), 24–70. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).