Boosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walks

Abstract

Item-based models are among the most popular collaborative filtering approaches for building recommender systems. Random walks can provide a powerful tool for harvesting the rich network of interactions captured within these models. They can exploit indirect relations between the items, mitigate the effects of sparsity, ensure wider itemspace coverage, as well as increase the diversity of recommendation lists. Their potential, however, can be hindered by the tendency of the walks to rapidly concentrate towards the central nodes of the graph, thereby significantly restricting the range of K-step distributions that can be exploited for personalized recommendations. In this work we introduce RecWalk; a novel random walk-based method that leverages the spectral properties of nearly uncoupled Markov chains to provably lift this limitation and prolong the influence of users' past preferences on the successive steps of the walk---allowing the walker to explore the underlying network more fruitfully. A comprehensive set of experiments on real-world datasets verify the theoretically predicted properties of the proposed approach and indicate that they are directly linked to significant improvements in top-n recommendation accuracy. They also highlight RecWalk's potential in providing a framework for boosting the performance of item-based models. RecWalk achieves state-of-the-art top-n recommendation quality outperforming several competing approaches, including recently proposed methods that rely on deep neural networks.

arXiv comment26 pages, complete version of the RecWalk conference paper that appeared in ACM WSDM 2019

References in corpus (13)

• BPR: Bayesian Personalized Ranking from Implicit Feedback
• Deep Learning based Recommender System: A Survey and New Perspectives
• Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering
• Solving the apparent diversity-accuracy dilemma of recommender systems
• NAIS: Neural Attentive Item Similarity Model for Recommendation
• Session-based Recommendations with Recurrent Neural Networks
• Adversarial Personalized Ranking for Recommendation
• Embarrassingly Shallow Autoencoders for Sparse Data
• Adaptive Diffusions for Scalable Learning over Graphs
• EigenRec: Generalizing PureSVD for Effective and Efficient Top-N Recommendations
• Top-N Recommendation on Graphs
• Random Surfing Without Teleportation
• Top-N recommendations in the presence of sparsity: An NCD-based approach

Cited by in corpus (2)

• S-Walk: Accurate and Scalable Session-based Recommendationwith Random Walks
• Random Surfing Revisited: Generalizing PageRank's Teleportation Model