Efficient Bayesian Methods for Graph-based Recommendation
Authors:
Open Access
- 7 September 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 333-340
Abstract
Short-length random walks on the bipartite user-item graph have recently been shown to provide accurate and diverse recommendations. Nonetheless, these approaches suffer from severe time and space requirements, which can be alleviated via random walk sampling, at the cost of reduced recommendation quality. In addition, these approaches ignore users' ratings, which further limits their expressiveness. In this paper, we introduce a computationally efficient graph-based approach for collaborative filtering based on short-path enumeration. Moreover, we propose three scoring functions based on the Bayesian paradigm that effectively exploit distributional aspects of the users' ratings. We experiment with seven publicly available datasets against state-of-the-art graph-based and matrix factorization approaches. Our empirical results demonstrate the effectiveness of the proposed approach, with significant improvements in most settings. Furthermore, analytical results demonstrate its efficiency compared to other graph-based approaches.Keywords
This publication has 15 references indexed in Scilit:
- Blockbusters and Wallflowers2015
- Inferring Networks of Substitutable and Complementary Products2015
- Random walks in recommender systems2014
- MyMediaLite2011
- Evaluating Recommendation Systems2010
- Trust-aware recommender systems2007
- Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative RecommendationIEEE Transactions on Knowledge and Data Engineering, 2007
- A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation2005
- Improving recommendation lists through topic diversification2005
- Cumulated gain-based evaluation of IR techniquesACM Transactions on Information Systems, 2002