Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems

被引:246
作者
Wu, Qitian [1 ]
Zhang, Hengrui [1 ]
Gao, Xiaofeng [1 ]
He, Peng [2 ]
Weng, Paul [3 ]
Gao, Han [2 ]
Chen, Guihai [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai Key Lab Scalable Comp & Syst, Shanghai, Peoples R China
[2] Tencent Inc, WeChat, Shenzhen, Peoples R China
[3] Shanghai Jiao Tong Univ, UM SJTU Joint Inst, Shanghai, Peoples R China
来源
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019) | 2019年
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Recommender Systems; Graph Neural Network; Contextual Multi-Armed Bandit; Representation Learning; Social Influence Analysis;
D O I
10.1145/3308558.3313442
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Social recommendation leverages social information to solve data sparsity and cold-start problems in traditional collaborative filtering methods. However, most existing models assume that social effects from friend users are static and under the forms of constant weights or fixed constraints. To relax this strong assumption, in this paper, we propose dual graph attention networks to collaboratively learn representations for two-fold social effects, where one is modeled by a user-specific attention weight and the other is modeled by a dynamic and context-aware attention weight. We also extend the social effects in user domain to item domain, so that information from related items can be leveraged to further alleviate the data sparsity problem. Furthermore, considering that different social effects in two domains could interact with each other and jointly influence users' preferences for items, we propose a new policy-based fusion strategy based on contextual multi-armed bandit to weigh interactions of various social effects. Experiments on one benchmark dataset and a commercial dataset verify the efficacy of the key components in our model. The results show that our model achieves great improvement for recommendation accuracy compared with other state-of-the-art social recommendation methods.
引用
收藏
页码:2091 / 2102
页数:12
相关论文
共 45 条
[1]  
[Anonymous], 2018, ABS181102815 CORR
[2]  
[Anonymous], 2018, P INT C MACH LEARN S
[3]  
[Anonymous], 2012, P 21 INT C WORLD WID, DOI [DOI 10.1145/2187980.2188254, 10.1145/2187980.2188254]
[4]  
[Anonymous], A LIEP
[5]  
[Anonymous], 2017, PROC INT C LEARN REP
[6]  
[Anonymous], ICWSM
[7]  
[Anonymous], 2018, ABS180902709 CORR
[8]  
[Anonymous], NEU COMP APPL
[9]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[10]  
c P., 2018, INT C LEARN REPR