{'fraction_non_alphanumeric': 0.018018018018018018, 'fraction_numerical': 0.0018018018018018018, 'mean_word_length': 5.104395604395604, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Predicting Retention in Sandbox Games with Tensor Factorization-based Representation Learning

Major commercial (AAA) games increasingly transit to a semi-persistent or persistent format in order to extend the value of the game to the player, and to add new sources of revenue beyond basic retail sales. Given this shift in the design of AAA titles, game analytics needs to address new types of problems, notably the problem of forecasting future player behavior. This is because player retention is a key factor in driving revenue in semi-persistent titles, for example via downloadable content. This paper introduces a model for predicting retention of players in AAA games and provides a tensor-based spatio-temporal model for analyzing player trajectories in 3D games. We show how knowledge as to trajectories can help with predicting player retention. Furthermore, we describe two new algorithms for three way DEDICOM including a fast gradient method and a seminonnegative constrained method. These approaches are validated against a detailed behavioral data set from the AAA open-world game Just Cause 2.