Recommender systems with social regularization

  • Authors:
  • Hao Ma;Dengyong Zhou;Chao Liu;Michael R. Lyu;Irwin King

  • Affiliations:
  • The Chinese University of Hong Kong, Shatin, Hong Kong;Microsoft Research, Redmond, WA, USA;Microsoft Research, Redmond, WA, USA;The Chinese University of Hong Kong, Shatin, Hong Kong;AT&T Labs - Research, Forlham Park, NJ, USA

  • Venue:
  • Proceedings of the fourth ACM international conference on Web search and data mining
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Although Recommender Systems have been comprehensively analyzed in the past decade, the study of social-based recommender systems just started. In this paper, aiming at providing a general method for improving recommender systems by incorporating social network information, we propose a matrix factorization framework with social regularization. The contributions of this paper are four-fold: (1) We elaborate how social network information can benefit recommender systems; (2) We interpret the differences between social-based recommender systems and trust-aware recommender systems; (3) We coin the term Social Regularization to represent the social constraints on recommender systems, and we systematically illustrate how to design a matrix factorization objective function with social regularization; and (4) The proposed method is quite general, which can be easily extended to incorporate other contextual information, like social tags, etc. The empirical analysis on two large datasets demonstrates that our approaches outperform other state-of-the-art methods.