3 of 2,721 Print all In new window Master Thesis Defense on "Churn Analysis in a Music Streaming Service: Predicting and understanding retention" (Monday, Aug 28, 10:30am)
Tid: Måndag 28 augusti 2017 kl 10:30 - 12:00
Plats: Ada Room
Student: Guilherme Dinis Chaliane Junior
Date and Time: 10:30am, Friday, 28th August 2017
Examiner: Šarūnas Girdzijauskas
Supervisor: Vladimir Vlassov
Title: "Churn Analysis in a Music Streaming Service: Predicting and understanding retention"
Opponent: Philipp Eisen, Ignacio Amaya
Abstract
Churn analysis can be understood as a problem of predicting and understanding abandonment of use of a product or service. Different industries ranging from entertainment to financial investment, and cloud providers make use of digital platforms where their users access their product offerings. Usage often leads to behavioural trails being left behind. These trails can then be mined to understand them better, improve the product or service, and to predict churn. In this thesis, we perform churn analysis on a real-life data set from a music streaming service, Spotify AB, with different signals, ranging from activity, to financial, temporal, and performance indicators. We compare logistic regression, random forest, along with neural networks for the task of churn prediction, and in addition to that, a fourth approach combining random forests with neural networks is proposed, and evaluated. Then, to come up with rules that are understandable to decision makers, a meta- heuristic technique is applied over the data set to extract Association Rules that describe quantified relationships between predictors and churn. We relate these findings to observed patterns in aggregate level data, finding probable explanations to how specific product features and user behaviours lead to churn or activation. For churn prediction, we found that all three non-linear methods performed better than logistic regression, suggesting the limitation of linear models for our use case, and our proposed enhanced random forest model performed mildly better than conventional random forest.