Sequential One-step Estimator by Sub-sampling for Customer Churn Analysis with Massive Data sets. Issue 5 (19th September 2022)

• Record Type: Journal Article
• Authors: Wang, Feifei; Huang, Danyang; Gao, Tianchen; Wu, Shuyuan; Wang, Hansheng
• Is Part Of: Journal of the Royal Statistical Society. Volume 71:Issue 5(2022)
• Page Start: 1753
• Page End: 1786
• Publication Date: 2022-09-19
• Subjects: customer churn -- massive data -- one-step estimator -- sequential estimator -- sub-sampling; Statistics -- Periodicals; 519.5
• DOI: 10.1111/rssc.12597
• Languages: English
• ISSNs: 0035-9254

Abstract

Abstract: Customer churn is one of the most important concerns for large companies. Currently, massive data are often encountered in customer churn analysis, which bring new challenges for model computation. To cope with these concerns, sub-sampling methods are often used to accomplish data analysis tasks of large scale. To cover more informative samples in one sampling round, classic sub-sampling methods need to compute sampling probabilities for all data points. However, this method creates a huge computational burden for data sets of large scale and therefore, is not applicable in practice. In this study, we propose a sequential one-step (SOS) estimation method based on repeated sub-sampling data sets. In the SOS method, data points need to be sampled only with probabilities, and the sampling step is conducted repeatedly. In each sampling step, a new estimate is computed via one-step updating based on the newly sampled data points. This leads to a sequence of estimates, of which the final SOS estimate is their average. We theoretically show that both the bias and the standard error of the SOS estimator can decrease with increasing sub-sampling sizes or sub-sampling times. The finite sample SOS performances are assessed through simulations. Finally, we apply this SOS method to analyse a real large-scale customer churn data set in a securities company. The results show that the SOS method has good interpretability and prediction power in this real application.