title: Walking on a user similarity network towards personalized recommendations.
abstract: Personalized recommender systems have been receiving more and more attention in addressing the serious problem of information overload accompanying the rapid evolution of the world-wide-web. Although traditional collaborative filtering approaches based on similarities between users have achieved remarkable success, it has been shown that the existence of popular objects may adversely influence the correct scoring of candidate objects, which lead to unreasonable recommendation results. Meanwhile, recent advances have demonstrated that approaches based on diffusion and random walk processes exhibit superior performance over collaborative filtering methods in both the recommendation accuracy and diversity. Building on these results, we adopt three strategies (power-law adjustment, nearest neighbor, and threshold filtration) to adjust a user similarity network from user similarity scores calculated on historical data, and then propose a random walk with restart model on the constructed network to achieve personalized recommendations. We perform cross-validation experiments on two real data sets (MovieLens and Netflix) and compare the performance of our method against the existing state-of-the-art methods. Results show that our method outperforms existing methods in not only recommendation accuracy and diversity, but also retrieval performance.
authors.affiliation: Department of Management Science and Engineering, Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing, China.
authors.forename: Mingxin
authors.initials: M
authors.lastname: Gan
mesh_terms: D000465:Algorithms; D016247:Information Storage and Retrieval; D020407:Internet; D008962:Models, Theoretical; D012984:Software