Diverse personalized recommendations with uncertainty from implicit preference data with the Bayesian Mallows model

作者:

Highlights:

摘要

Clicking data, which exists in abundance and contains objective user preference information, is widely used to produce personalized recommendations in web-based applications. Current popular recommendation algorithms, typically based on matrix factorizations, often focus on achieving high accuracy. While achieving good clickthrough rates, diversity of the recommended items is often overlooked. Moreover, most algorithms do not produce interpretable uncertainty quantifications of the recommendations. In this work, we propose the Bayesian Mallows for Clicking Data (BMCD) method, which simultaneously considers accuracy and diversity. BMCD augments clicking data into compatible full ranking vectors by enforcing all the clicked items clicked by a user to be top-ranked regardless of their rarity. User preferences are learned using a Mallows ranking model. Bayesian inference leads to interpretable uncertainties of each individual recommendation, and we also propose a method to make personalized recommendations based on such uncertainties. With a simulation study and a real life data example, we demonstrate that compared to state-of-the-art matrix factorization, BMCD makes personalized recommendations with similar accuracy, while achieving much higher level of diversity, and producing interpretable and actionable uncertainty estimation.

论文关键词:Preference learning,Collaborative filtering,Clicking data,Probabilistic modeling

论文评审过程:Received 11 February 2019, Revised 8 August 2019, Accepted 15 August 2019, Available online 20 August 2019, Version of Record 5 November 2019.

论文官网地址:https://doi.org/10.1016/j.knosys.2019.104960