Towards Robust Neural Graph Collaborative Filtering via Structure Denoising and Embedding Perturbation

被引:42
作者
Ye, Haibo [1 ]
Li, Xinjie [1 ]
Yao, Yuan [2 ]
Tong, Hanghang [3 ]
机构
[1] 29 Jiangjun Rd, Nanjing 210000, Jiangsu Provinc, Peoples R China
[2] 163 Xianlin Ave, Nanjing 210000, Jiangsu Provinc, Peoples R China
[3] 201 N Goodwin Ave, Urbana, IL 61801 USA
基金
国家重点研发计划;
关键词
Neural graph collaborative filtering; graph neural networks; contrastive learning; structure denoising; embedding perturbation;
D O I
10.1145/3568396
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Neural graph collaborative filtering has received great recent attention due to its power of encoding the high-order neighborhood via the backbone graph neural networks. However, their robustness against noisy user-item interactions remains largely unexplored. Existing work on robust collaborative filtering mainly improves the robustness by denoising the graph structure, while recent progress in other fields has shown that directly adding adversarial perturbations in the embedding space can significantly improve the model robustness. In this work, we propose to improve the robustness of neural graph collaborative filtering via both denoising in the structure space and perturbing in the embedding space. Specifically, in the structure space, we measure the reliability of interactions and further use it to affect the message propagation process of the backbone graph neural networks; in the embedding space, we add in-distribution perturbations by mimicking the behavior of adversarial attacks and further combine it with contrastive learning to improve the performance. Extensive experiments have been conducted on four benchmark datasets to evaluate the effectiveness and efficiency of the proposed approach. The results demonstrate that the proposed approach outperforms the recent neural graph collaborative filtering methods especially when there are injected noisy interactions in the training data.
引用
收藏
页数:28
相关论文
共 71 条
[1]  
Baluja Shumeet., 2008, Proceedings of WWW, P895, DOI DOI 10.1145/1367497.1367618
[2]   Learning Graph-Based Geographical Latent Representation for Point-of-Interest Recommendation [J].
Chang, Buru ;
Jang, Gwanghoon ;
Kim, Seoyoon ;
Kang, Jaewoo .
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, :135-144
[3]   Sequential Recommendation with Graph Neural Networks [J].
Chang, Jianxin ;
Gao, Chen ;
Zheng, Yu ;
Hui, Yiqun ;
Niu, Yanan ;
Song, Yang ;
Jin, Depeng ;
Li, Yong .
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, :378-387
[4]   Structured Graph Convolutional Networks with Stochastic Masks for Recommender Systems [J].
Chen, Huiyuan ;
Wang, Lan ;
Lin, Yusan ;
Yeh, Chin-Chia Michael ;
Wang, Fei ;
Yang, Hao .
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, :614-623
[5]  
Chen J., 2020, ARXIV201003240
[6]  
Chen L, 2020, AAAI CONF ARTIF INTE, V34, P27
[7]   Handling Information Loss of Graph Neural Networks for Session-based Recommendation [J].
Chen, Tianwen ;
Wong, Raymond Chi-Wing .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :1172-1180
[8]  
Cho E., 2011, PROC 17 ACM SIGKDD I, P1082
[9]   Adversarial Attacks on an Oblivious Recommender [J].
Christakopoulou, Konstantina ;
Banerjee, Arindam .
RECSYS 2019: 13TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2019, :322-330
[10]  
Dai Hanjun, 2018, P INT C MACH LEARN