Abstract
Social recommender system, using social relation networks as additional input to improve the accuracy of traditional recommender systems, has become an important research topic. However, most existing methods utilize the entire user relationship network with no consideration to its huge size, sparsity, imbalance, and noise issues. This may degrade the efficiency and accuracy of social recommender systems. This study proposes a new approach to manage the complexity of adding social relation networks to recommender systems. Our method first generates an individual relationship network (IRN) for each user and item by developing a novel fitting algorithm of relationship networks to control the relationship propagation and contracting. We then fuse matrix factorization with social regularization and the neighborhood model using IRN's to generate recommendations. Our approach is quite general, and can also be applied to the item-item relationship network by switching the roles of users and items. Experiments on four datasets with different sizes, sparsity levels, and relationship types show that our approach can improve predictive accuracy and gain a better scalability compared with state-of-The-Art social recommendation methods.
Original language | English |
---|---|
Article number | 7954736 |
Pages (from-to) | 2086-2099 |
Number of pages | 14 |
Journal | IEEE Transactions on Knowledge and Data Engineering |
Volume | 29 |
Issue number | 10 |
DOIs | |
State | Published - 01 10 2017 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Keywords
- Matrix factorization
- Neighborhood model
- Scalability
- Social networks
- Social recommendation
- Sparsity