Explainability, risk modeling, and segmentation based customer churn analytics for personalized retention in e-commerce

• URL: http://arxiv.org/abs/2510.11604v1
• Date: Mon, 13 Oct 2025 16:44:24 GMT
• Title: Explainability, risk modeling, and segmentation based customer churn analytics for personalized retention in e-commerce
• Authors: Sanjula De Alwis, Indrajith Ekanayake,
• Abstract summary: This study advances a three-component framework that integrates explainable AI to quantify feature contributions, survival analysis to model time-to-event churn risk, and RFM profiling to segment customers by transactional behaviour.<n>In combination, these methods enable the attribution of churn drivers, estimation of intervention windows, and prioritization of segments for targeted actions, thereby supporting strategies that reduce attrition and strengthen customer loyalty.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In online retail, customer acquisition typically incurs higher costs than customer retention, motivating firms to invest in churn analytics. However, many contemporary churn models operate as opaque black boxes, limiting insight into the determinants of attrition, the timing of retention opportunities, and the identification of high-risk customer segments. Accordingly, the emphasis should shift from prediction alone to the design of personalized retention strategies grounded in interpretable evidence. This study advances a three-component framework that integrates explainable AI to quantify feature contributions, survival analysis to model time-to-event churn risk, and RFM profiling to segment customers by transactional behaviour. In combination, these methods enable the attribution of churn drivers, estimation of intervention windows, and prioritization of segments for targeted actions, thereby supporting strategies that reduce attrition and strengthen customer loyalty.

Related papers

• ReviewSense: Transforming Customer Review Dynamics into Actionable Business Insights [5.841738615509162]
  ReviewSense is a novel framework that transforms customer reviews into targeted, actionable business recommendations.<n>By identifying key trends, recurring issues, and specific concerns within customer sentiments, ReviewSense extends beyond preference-based systems.<n>Preliminary manual evaluations indicate strong alignment between the model's recommendations and business objectives.
  arXiv  Detail & Related papers  (2025-10-18T12:20:15Z)
• CATS: Clustering-Aggregated and Time Series for Business Customer Purchase Intention Prediction [7.294680030004759]
  Predicting whether a customer will make the next purchase is a classic time series forecasting task.<n>Customer groups typically exhibit imbalance - i.e., there are a large number of occasional buyers and a small number of loyal customers.<n>This paper proposes a unified Clustering and Attention GRU model that leverages multi-modal data for customer purchase intention prediction.
  arXiv  Detail & Related papers  (2025-05-19T09:07:34Z)
• Rethinking Byzantine Robustness in Federated Recommendation from Sparse Aggregation Perspective [65.65471972217814]
  federated recommendation (FR) based on federated learning (FL) emerges, keeping the personal data on the local client and updating a model collaboratively.<n>FR has a unique sparse aggregation mechanism, where the embedding of each item is updated by only partial clients, instead of full clients in a dense aggregation of general FL.<n>In this paper, we reformulate the Byzantine robustness under sparse aggregation by defining the aggregation for a single item as the smallest execution unit.<n>We propose a family of effective attack strategies, named Spattack, which exploit the vulnerability in sparse aggregation and are categorized along the adversary's knowledge and capability.
  arXiv  Detail & Related papers  (2025-01-06T15:19:26Z)
• Criticality and Safety Margins for Reinforcement Learning [53.10194953873209]
  We seek to define a criticality framework with both a quantifiable ground truth and a clear significance to users.<n>We introduce true criticality as the expected drop in reward when an agent deviates from its policy for n consecutive random actions.<n>We also introduce the concept of proxy criticality, a low-overhead metric that has a statistically monotonic relationship to true criticality.
  arXiv  Detail & Related papers  (2024-09-26T21:00:45Z)
• Segment Discovery: Enhancing E-commerce Targeting [8.000199536112937]
  This paper proposes a policy framework based on uplift modeling and constrained optimization.<n>We demonstrate improvement over state-of-the-art targeting approaches using two large-scale experimental studies and a production implementation.
  arXiv  Detail & Related papers  (2024-09-20T18:42:04Z)
• Emulating Full Participation: An Effective and Fair Client Selection Strategy for Federated Learning [50.060154488277036]
  In federated learning, client selection is a critical problem that significantly impacts both model performance and fairness.<n>We propose two guiding principles that tackle the inherent conflict between the two metrics while reinforcing each other.<n>Our approach adaptively enhances this diversity by selecting clients based on their data distributions, thereby improving both model performance and fairness.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• AgentBoard: An Analytical Evaluation Board of Multi-turn LLM Agents [74.16170899755281]
  We introduce AgentBoard, a pioneering comprehensive benchmark and accompanied open-source evaluation framework tailored to analytical evaluation of LLM agents.<n>AgentBoard offers a fine-grained progress rate metric that captures incremental advancements as well as a comprehensive evaluation toolkit.<n>This not only sheds light on the capabilities and limitations of LLM agents but also propels the interpretability of their performance to the forefront.
  arXiv  Detail & Related papers  (2024-01-24T01:51:00Z)
• Client-side Gradient Inversion Against Federated Learning from Poisoning [59.74484221875662]
  Federated Learning (FL) enables distributed participants to train a global model without sharing data directly to a central server. Recent studies have revealed that FL is vulnerable to gradient inversion attack (GIA), which aims to reconstruct the original training samples. We propose Client-side poisoning Gradient Inversion (CGI), which is a novel attack method that can be launched from clients.
  arXiv  Detail & Related papers  (2023-09-14T03:48:27Z)
• Provably Personalized and Robust Federated Learning [47.50663360022456]
  We propose simple algorithms which identify clusters of similar clients and train a personalized modelper-cluster. The convergence rates of our algorithmsally match those obtained if we knew the true underlying clustering of the clients and are provably robust in the Byzantine setting.
  arXiv  Detail & Related papers  (2023-06-14T09:37:39Z)
• G$^2$uardFL: Safeguarding Federated Learning Against Backdoor Attacks through Attributed Client Graph Clustering [116.4277292854053]
  Federated Learning (FL) offers collaborative model training without data sharing. FL is vulnerable to backdoor attacks, where poisoned model weights lead to compromised system integrity. We present G$2$uardFL, a protective framework that reinterprets the identification of malicious clients as an attributed graph clustering problem.
  arXiv  Detail & Related papers  (2023-06-08T07:15:04Z)
• FedGT: Identification of Malicious Clients in Federated Learning with Secure Aggregation [69.75513501757628]
  FedGT is a novel framework for identifying malicious clients in federated learning with secure aggregation. We show that FedGT significantly outperforms the private robust aggregation approach based on the geometric median recently proposed by Pillutla et al.
  arXiv  Detail & Related papers  (2023-05-09T14:54:59Z)
• Improved Churn Causal Analysis Through Restrained High-Dimensional Feature Space Effects in Financial Institutions [9.84528076130809]
  Customer churn describes terminating a relationship with a business or reducing customer engagement over a specific period. Customer acquisition cost can be five to six times that of customer retention, hence investing in customers with churn risk is wise. This study presents a conceptual framework to discover the confounding features that correlate with independent variables and are causally related to those dependent variables that impact churn.
  arXiv  Detail & Related papers  (2023-04-23T00:45:35Z)
• Causal Analysis of Customer Churn Using Deep Learning [9.84528076130809]
  Customer churn describes terminating a relationship with a business or reducing customer engagement over a specific period. This paper proposes a framework using a deep feedforward neural network for classification. We also propose a causal Bayesian network to predict cause probabilities that lead to customer churn.
  arXiv  Detail & Related papers  (2023-04-20T18:56:13Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• Customer Churn Prediction Model using Explainable Machine Learning [0.0]
  Key objective of the paper is to develop a unique Customer churn prediction model which can help to predict potential customers who are most likely to churn. We evaluated and analyzed the performance of various tree-based machine learning approaches and algorithms. In order to improve Model explainability and transparency, paper proposed a novel approach to calculate Shapley values for possible combination of features.
  arXiv  Detail & Related papers  (2023-03-02T04:45:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.