Abstract

In recent years, Graph Neural Networks (GNNs), which can naturally integrate node information and topological structure, have been demonstrated to be powerful in learning on graph data. These advantages of GNNs provide great potential to advance social recommendation since data in social recommender systems can be represented as user-user social graph and user-item graph; and learning latent factors of users and items is the key. However, building social recommender systems based on GNNs faces challenges. For example, the user-item graph encodes both interactions and their associated opinions; social relations have heterogeneous strengths; users involve in two graphs (e.g., the user-user social graph and the user-item graph). To address the three aforementioned challenges simultaneously, in this paper, we present a novel graph neural network framework (GraphRec) for social recommendations. In particular, we provide a principled approach to jointly capture interactions and opinions in the user-item graph and propose the framework GraphRec, which coherently models two graphs and heterogeneous strengths. Extensive experiments on two real-world datasets demonstrate the effectiveness of the proposed framework GraphRec.

Keywords

Computer scienceRecommender systemSocial graphGraphGraph databaseTheoretical computer scienceArtificial intelligenceMachine learningInformation retrievalData scienceWorld Wide WebSocial media

Affiliated Institutions

Related Publications

TriRank

Most existing collaborative filtering techniques have focused on modeling the binary relation of users to items by extracting from user ratings. Aside from users' ratings, their...

2015 452 citations

Publication Info

Year
2019
Type
article
Pages
417-426
Citations
1770
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1770
OpenAlex
104
Influential

Cite This

Wenqi Fan, Yao Ma, Qing Li et al. (2019). Graph Neural Networks for Social Recommendation. The World Wide Web Conference , 417-426. https://doi.org/10.1145/3308558.3313488

Identifiers

DOI
10.1145/3308558.3313488
arXiv
1902.07243

Data Quality

Data completeness: 84%