Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning

被引:349
作者
Lin, Zihan [1 ]
Tian, Changxin [1 ]
Hou, Yupeng [2 ]
Zhao, Wayne Xin [2 ,3 ]
机构
[1] Renmin Univ China, Sch Informat, Beijing, Peoples R China
[2] Renmin Univ China, Gaoling Sch Artificial Intelligence, Beijing, Peoples R China
[3] Beijing Key Lab Big Data Management & Anal Method, Beijing, Peoples R China
来源
PROCEEDINGS OF THE ACM WEB CONFERENCE 2022 (WWW'22) | 2022年
基金
中国国家自然科学基金;
关键词
Recommender System; Collaborative Filtering; Contrastive Learning; Graph Neural Network;
D O I
10.1145/3485447.3512104
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, graph collaborative filtering methods have been proposed as an effective recommendation approach, which can capture users' preference over items by modeling the user-item interaction graphs. Despite the effectiveness, these methods suffer from data sparsity in real scenarios. In order to reduce the influence of data sparsity, contrastive learning is adopted in graph collaborative filtering for enhancing the performance. However, these methods typically construct the contrastive pairs by random sampling, which neglect the neighboring relations among users (or items) and fail to fully exploit the potential of contrastive learning for recommendation. To tackle the above issue, we propose a novel contrastive learning approach, named Neighborhood-enriched Contrastive Learning, named NCL, which explicitly incorporates the potential neighbors into contrastive pairs. Specifically, we introduce the neighbors of a user (or an item) from graph structure and semantic space respectively. For the structural neighbors on the interaction graph, we develop a novel structure-contrastive objective that regards users (or items) and their structural neighbors as positive contrastive pairs. In implementation, the representations of users (or items) and neighbors correspond to the outputs of different GNN layers. Furthermore, to excavate the potential neighbor relation in semantic space, we assume that users with similar representations are within the semantic neighborhood, and incorporate these semantic neighbors into the prototype-contrastive objective. The proposed NCL can be optimized with EM algorithm and generalized to apply to graph collaborative filtering methods. Extensive experiments on five public datasets demonstrate the effectiveness of the proposed NCL, notably with 26% and 17% performance gain over a competitive graph collaborative filtering base model on the Yelp and Amazon-book datasets, respectively. Our implementation code is available at: https://github.com/RUCAIBox/NCL.
引用
收藏
页码:2320 / 2329
页数:10
相关论文
共 45 条
[1]  
[Anonymous], 2011, P 17 ACM SIGKDD INT, DOI DOI 10.1145/2020408.2020579
[2]  
[Anonymous], 2020, INT C MACH LEARN
[3]  
Baluja S., 2008, P 17 INT C WORLD WID, P895, DOI DOI 10.1145/1367497.1367618
[4]   POG: Personalized Outfit Generation for Fashion Recommendation at Alibaba iFashion [J].
Chen, Wen ;
Huang, Pipei ;
Xu, Jiaming ;
Guo, Xin ;
Guo, Cheng ;
Sun, Fei ;
Li, Chao ;
Pfadler, Andreas ;
Zhao, Huan ;
Zhao, Binqiang .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2662-2670
[5]  
Giorgi John M, 2020, ARXIV200603659
[6]  
Gori M, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2766
[7]   The MovieLens Datasets: History and Context [J].
Harper, F. Maxwell ;
Konstan, Joseph A. .
ACM TRANSACTIONS ON INTERACTIVE INTELLIGENT SYSTEMS, 2016, 5 (04)
[8]  
Hassani K, 2020, PR MACH LEARN RES, V119
[9]   LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation [J].
He, Xiangnan ;
Deng, Kuan ;
Wang, Xiang ;
Li, Yan ;
Zhang, Yongdong ;
Wang, Meng .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :639-648
[10]   Neural Collaborative Filtering [J].
He, Xiangnan ;
Liao, Lizi ;
Zhang, Hanwang ;
Nie, Liqiang ;
Hu, Xia ;
Chua, Tat-Seng .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :173-182