Solving the accuracy-diversity dilemma via directed random walks
arXiv:1201.6278 · doi:10.1103/PhysRevE.85.016118
Abstract
Random walks have been successfully used to measure user or object similarities in collaborative filtering (CF) recommender systems, which is of high accuracy but low diversity. A key challenge of CF system is that the reliably accurate results are obtained with the help of peers' recommendation, but the most useful individual recommendations are hard to be found among diverse niche objects. In this paper we investigate the direction effect of the random walk on user similarity measurements and find that the user similarity, calculated by directed random walks, is reverse to the initial node's degree. Since the ratio of small-degree users to large-degree users is very large in real data sets, the large-degree users' selections are recommended extensively by traditional CF algorithms. By tuning the user similarity direction from neighbors to the target user, we introduce a new algorithm specifically to address the challenge of diversity of CF and show how it can be used to solve the accuracy-diversity dilemma. Without relying on any context-specific information, we are able to obtain accurate and diverse recommendations, which outperforms the state-of-the-art CF methods. This work suggests that the random walk direction is an important factor to improve the personalized recommendation performance.
8 pages, 6 figures
References in corpus (7)
- Predicting Missing Links via Local Information
- Communicability in complex networks
- Heat Conduction Process on Community Networks as a Recommendation Model
- Effect of initial configuration on network-based recommendation
- Information filtering via biased heat conduction
- Information filtering via preferential diffusion
- Information filtering based on transferring similarity
Cited by in corpus (9)
- How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utility
- Information Filtering via Collaborative User Clustering Modeling
- A vertex similarity index for better personalized recommendation
- Information Filtering on Coupled Social Networks
- Predicting the evolution of complex networks via local information
- A Fast Recommendation Algorithm for Social Tagging Systems : A Delicious Case
- D-RDW: Diversity-Driven Random Walks for News Recommender Systems
- Network Flow Based Post Processing for Sales Diversity
- Heterogeneity Involved Network-based Algorithm Leads to Accurate and Personalized Recommendations