We develop an adapted version of the Bayesian Personalized Ranking (BPR) optimization criterion (Rendle et al., 2009) that takes the non-uniform sampling of negative test items — as in track 2 of the KDD Cup 2011 — into account. Furthermore, we present a modified version of the generic BPR learning algorithm that maximizes the new criterion. We use it to train ranking matrix factorization models as components of an ensemble. Additionally, we combine the ranking predictions with rating prediction models to also take into account rating data.#R##N##R##N#With an ensemble of such combined models, we ranked 8th (out of more than 300 teams) in track 2 of the KDD Cup 2011, without using the additional taxonomic information offered by the competition organizers.
['Zeno Gantner', 'Lucas Drumond', 'Christoph Freudenthaler', 'Lars Schmidt-Thieme']
Personalized Ranking for non-uniformly sampled items