Abstract

Recent research on recommender systems has proved that by leveraging social network information, the quality of recommendations can be evidently improved. Traditional social recommendation models typically <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">linearly</i> combine social network information. For instance, matrix factorization based models linearly combine latent factors of relevant users and items. However, in practice, the multifaceted social relations are so complex that simple linear combination may not be able to reasonably organize such information for accurate social recommendation. On the other hand, existing deep learning based non-linear methods lack systematic modeling of user-item-friend relations. To handle these issues, we propose a novel, non-linear latent factor model for social recommendations leveraging Gaussian process. By introducing a social-aware covariance function, we organize individual users’ past feedback, as well as the associated social information (e.g., friends’ feedback to the same items) into a covariance matrix, which non-linearly and systematically learns the complex interactions among users, their interacted items and their friends’ opinions. A stochastic gradient descent based optimization algorithm is developed to fit the model. Extensive experiments conducted on three real-world datasets demonstrate that the proposed model outperforms the state-of-the-art social recommendation models and Gaussian process based models.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.