Churn prediction of mobile and online casual games using play log data
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Internet-connected devices, especially mobile devices such as smartphones, have become widely accessible in the past decade. Interaction with such devices has evolved into frequent and short-duration usage, and this phenomenon has resulted in a pervasive popularity of casual games in the game sector. On the other hand, development of casual games has become easier than ever as a result of the advancement of development tools. With the resulting fierce competition, now both acquisition and retention of users are the prime concerns in the field. In this study, we focus on churn prediction of mobile and online casual games. While churn prediction and analysis can provide important insights and action cues on retention, its application using play log data has been primitive or very limited in the casual game area. Most of the existing methods cannot be applied to casual games because casual game players tend to churn very quickly and they do not pay periodic subscription fees. Therefore, we focus on the new players and formally define churn using observation period (OP) and churn prediction period (CP). Using the definition, we develop a standard churn analysis process for casual games. We cover essential topics such as pre-processing of raw data, feature engineering including feature analysis, churn prediction modeling using traditional machine learning algorithms (logistic regression, gradient boosting, and random forests) and two deep learning algorithms (CNN and LSTM), and sensitivity analysis for OP and CP. Play log data of three different casual games are considered by analyzing a total of 193,443 unique player records and 10,874,958 play log records. While the analysis results provide useful insights, the overall results indicate that a small number of well-chosen features used as performance metrics might be sufficient for making important action decisions and that OP and CP should be properly chosen depending on the analysis goal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
Hanley, J. A., & McNeil, B. J. (1982) · Radiology · doi:10.1148/radiology.143.1.7063747 · Cited by 21,856
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
Ganesh, J., Arnold, M. J., & Reynolds, K. E. (2000) · Journal of Marketing · doi:10.1509/jmkg.64.3.65.18028 · Cited by 1,305 · cited 1×
“This is well-known to be possible, because typically users who will be out of service appear to differ [9].”
BackgroundA novel evolutionary data mining algorithm with applications to churn prediction
Au, W.-H., Chan, K. C. C., & Yao, X. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819264 · Cited by 348
Predicting player churn in the wild
Hadiji, F., Sifa, R., Drachen, A., Thurau, C., Kersting, K., & Bauckhage, C. (2014) · 2014 IEEE Conference on Computational Intelligence and Games · doi:10.1109/cig.2014.6932876 · Cited by 171 · cited 1×
“Hadiji et al. (2014) explained the definition of user churn prediction as two concepts and formulated the input data for the prediction as two methods as well [11].”
MethodChurn prediction for high-value players in casual social games
Runge, J., Gao, P., Garcin, F., & Faltings, B. (2014) · 2014 IEEE Conference on Computational Intelligence and Games · doi:10.1109/cig.2014.6932875 · Cited by 152
Cited by
A Survey on Churn Analysis in Various Business Domains
Ahn, J., Hwang, J., Kim, D., Choi, H., & Kang, S. (2020) · IEEE Access · doi:10.1109/access.2020.3042657 · Cited by 139
Predicting Game Difficulty and Churn Without Players
Roohi, S., Relas, A., Takatalo, J., Heiskanen, H., & Hämäläinen, P. (2020) · Proceedings of the Annual Symposium on Computer-Human Interaction in Play · doi:10.1145/3410404.3414235 · Cited by 34
Bricker, J., Miao, Z., Mull, K., Santiago-Torres, M., & Vock, D. M. (2023) · Journal of Medical Internet Research · doi:10.2196/43629 · Cited by 22
“For example, in an analysis of casual gaming data, Kim et al [51] evaluated 5 different machine learning algorithms to predict game player churn (ie, dropout) in web-based and mobile games and found that, although prediction performance evaluated using AUC had little dependence on the choice of…”
Metadata
- Authors
- Kim, S., Choi, D., Lee, E., & Rhee, W.
- Venue
- PLOS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2017-07-05
- Volume
- 12
- Issue
- 7
- Pages
- e0180735
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2727476476
- Cited by
- 72
- References
- 11
- FWCI
- 10.89
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Churn prediction of mobile and online casual games using play log data. https://app.cochat.ai/papers/10.1371/journal.pone.0180735
- The paper
- Kim, S., Choi, D., Lee, E., & Rhee, W. (2017). Churn prediction of mobile and online casual games using play log data. PLOS ONE. https://doi.org/10.1371/journal.pone.0180735
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.