Abstract

Although recommendation techniques have achieved distinct developments over the decades, the data sparseness problem of the involved user-item matrix still seriously influences the recommendation quality. Most of the existing techniques for recommender systems cannot easily deal with users who have very few ratings. How to combine the increasing amount of different types of social information such as user generated content and social relationships to enhance the prediction precision of the recommender systems remains a huge challenge. In this paper, based on a factor graph model, we formalize the problem in a semi-supervised probabilistic model, which can incorporate different user information, user relationships, and user-item ratings for learning to predict the unknown ratings. We evaluate the method in two different genres of datasets, Douban and Last.fm. Experiments indicate that our method outperforms several state-of-the-art recommendation algorithms. Furthermore, a distributed learning algorithm is developed to scale up the approach to real large datasets.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call