Bayesian Deep Learning with Trust and Distrust in Recommendation Systems

被引:5
作者
Rafailidis, Dimitrios [1 ]
机构
[1] Maastricht Univ, Maastricht, Netherlands
来源
2019 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE (WI 2019) | 2019年
关键词
Pairwise learning; social relationships; deep learning; collaborative filtering;
D O I
10.1145/3350546.3352496
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Exploiting the selections of social friends and foes can efficiently face the data scarcity of user preferences and the cold-start problem. In this paper, we present a Social Deep Pairwise Learning model, namely SDPL. According to the Bayesian Pairwise Ranking criterion, we design a loss function with multiple ranking criteria based on the selections of users, and those in their friends and foes to improve the accuracy in the top-k recommendation task. We capture the nonlinearity in user preferences and the social information of trust and distrust relationships by designing a deep learning architecture. In each backpropagation step, we perform social negative sampling to meet the multiple ranking criteria of our loss function. Our experiments on a benchmark dataset from Epinions, among the largest publicly available that has been reported in the relevant literature, demonstrate the effectiveness of the proposed approach, outperforming other state-of-the art methods. In addition, we show that our deep learning strategy plays an important role in capturing the nonlinear associations between user preferences and the social information of trust and distrust relationships, and demonstrate that our social negative sampling strategy is a key factor in SDPL.
引用
收藏
页码:18 / 25
页数:8
相关论文
共 36 条
[1]   Personalized Keyword Boosting for Venue Suggestion Based on Multiple LBSNs [J].
Aliannejadi, Mohammad ;
Rafailidis, Dimitrios ;
Crestani, Fabio .
ADVANCES IN INFORMATION RETRIEVAL, ECIR 2017, 2017, 10193 :291-303
[2]  
[Anonymous], 2004, P 13 INT C WORLD WID, DOI DOI 10.1145/988672.988727
[3]   Link injection for boosting information spread in social networks [J].
Antaris, Stefanos ;
Rafailidis, Dimitrios ;
Nanopoulos, Alexandros .
SOCIAL NETWORK ANALYSIS AND MINING, 2014, 4 (01) :1-16
[4]  
Celma O, 2008, RECSYS'08: PROCEEDINGS OF THE 2008 ACM CONFERENCE ON RECOMMENDER SYSTEMS, P179
[5]  
Chaney A.J., 2015, Proceedings of the 9th ACM Conference on Recommender Systems, P43, DOI [10.1145/2792838.2800193, DOI 10.1145/2792838.2800193]
[6]   On Sampling Strategies for Neural Network-based Collaborative Filtering [J].
Chen, Ting ;
Sun, Yizhou ;
Shi, Yue ;
Hong, Liangjie .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :767-776
[7]   On Deep Learning for Trust-Aware Recommendations in Social Networks [J].
Deng, Shuiguang ;
Huang, Longtao ;
Xu, Guandong ;
Wu, Xindong ;
Wu, Zhaohui .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2017, 28 (05) :1164-1177
[8]   BayDNN: Friend Recommendation with Bayesian Personalized Ranking Deep Neural Network [J].
Ding, Daizong ;
Zhang, Mi ;
Li, Shao-Yuan ;
Tang, Jie ;
Chen, Xiaotie ;
Zhou, Zhi-Hua .
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, :1479-1488
[9]  
Forsati R., 2015, P 9 ACM C REC SYST N, P51, DOI [10.1145/2792838.2800198, DOI 10.1145/2792838.2800198]
[10]   Matrix Factorization with Explicit Trust and Distrust Side Information for Improved Social Recommendation [J].
Forsati, Rana ;
Mahdavi, Mehrdad ;
Shamsfard, Mehrnoush ;
Sarwat, Mohamed .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2014, 32 (04) :1-38