Boosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walks
Athanasios N. Nikolakopoulos, George Karypis

TL;DR
RecWalk is a novel random walk method that enhances item-based collaborative filtering by leveraging nearly uncoupled Markov chains, leading to improved recommendation accuracy and broader network exploration.
Contribution
Introduces RecWalk, a spectral-based random walk technique that mitigates walk concentration issues, significantly boosting item-based collaborative filtering performance.
Findings
RecWalk outperforms existing methods in top-n recommendation accuracy.
The approach effectively explores the item network, reducing sparsity effects.
Experimental results confirm theoretical advantages of nearly uncoupled Markov chains.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
