REVIEW 2 cited by
Churn Prediction with Sequential Data and Deep Neural Networks. A Comparative Analysis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Off-the-shelf machine learning algorithms for prediction such as regularized logistic regression cannot exploit the information of time-varying features without previously using an aggregation procedure of such sequential data. However, recurrent neural networks provide an alternative approach by which time-varying features can be readily used for modeling. This paper assesses the performance of neural networks for churn modeling using recency, frequency, and monetary value data from a financial services provider. Results show that RFM variables in combination with LSTM neural networks have larger top-decile lift and expected maximum profit metrics than regularized logistic regression models with commonly-used demographic variables. Moreover, we show that using the fitted probabilities from the LSTM as feature in the logistic regression increases the out-of-sample performance of the latter by 25 percent compared to a model with only static features.
Forward citations
Cited by 2 Pith papers
-
Snorkeling in dark waters: A longitudinal surface exploration of unique Tor Hidden Services (Extended Version)
A mirror-aware crawl of more than 24,000 Tor hidden-service landing pages finds roughly 82% are replicated content, and ignoring mirrors distorts dark web topology and category estimates.
-
A Computational Ethical Framework for Financial Digital Phenotyping for Mental Health
Ethical rules for financial digital phenotyping can be written as deontic temporal constraints whose violations Z3 proves unsatisfiable inside the formal model.
Discussion (0). Continue with ORCID to comment.