Contrastive multi-interest graph attention network for knowledge-aware recommendation

被引:5
作者
Liu, Jianfang [1 ,2 ]
Wang, Wei [3 ]
Yi, Baolin [1 ]
Shen, Xiaoxuan [1 ]
Zhang, Huanyu [1 ]
机构
[1] Cent China Normal Univ, Natl Engn Res Ctr Educ Big Data, Wuhan 430079, Hubei, Peoples R China
[2] Pingdingshan Univ, Software Coll, Pingdingshan 467000, Henan, Peoples R China
[3] Hubei Univ Chinese Med, Coll Informat Engn, Wuhan 430065, Hubei, Peoples R China
关键词
Contrastive learning; Multi-interest; Knowledge graph; Recommendation; Graph attention network;
D O I
10.1016/j.eswa.2024.124748
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Acquiring high-quality representations for both users and items is essential, facilitating a wide range of recommendation scenarios. Utilizing graph neural networks for knowledge-aware recommendation is a recent trend. However, there are two deficiencies in existing GNN-based knowledge-aware models: (1) They are coarse-grained in user representation, failing to capture the multi-interest distribution of users. (2) The supervised signals come only from historical interactions, failing to provide high-quality representations due to sparse data. In this paper, we propose a novel model, CMGAN with Contrastive Multi-interest Graph Attention Network, , tailored for personalized knowledge-aware recommendations. Specifically, CMGAN employs a collaborative knowledge graph encoder, enhancing node representations through relational-aware embedding aggregation. Then a dynamic multi-interest generator crafts fine-grained multi-interest representations, adeptly extracting varied interests for each user based on their historical interactions. Furthermore, CMGAN innovates by integrating multi-level contrastive learning to refine representations at both node and multi-interest granularity. It consists of collaborative knowledge graph contrastive learning and multi-interest contrastive learning. The former pursues the acquisition of node representations that are more uniformly distributed, while the latter aims to obtain interest representations that are more distinct. A series of experiments on three benchmark datasets indicate that our model surpasses current state-of-the-art models. The code can be obtainable at https://github.com/liujianfang2021/CMGAN.
引用
收藏
页数:11
相关论文
共 68 条
[51]   Collaborative contrastive learning for hypergraph node classification [J].
Wu, Hanrui ;
Li, Nuosi ;
Zhang, Jia ;
Chen, Sentao ;
Ng, Michael K. ;
Long, Jinyi .
PATTERN RECOGNITION, 2024, 146
[52]   Self-supervised Graph Learning for Recommendation [J].
Wu, Jiancan ;
Wang, Xiang ;
Feng, Fuli ;
He, Xiangnan ;
Chen, Liang ;
Lian, Jianxun ;
Xie, Xing .
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, :726-735
[53]   Hypergraph Contrastive Collaborative Filtering [J].
Xia, Lianghao ;
Huang, Chao ;
Xu, Yong ;
Zhao, Jiashu ;
Yin, Dawei ;
Huang, Jimmy .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :70-79
[54]   Deep Multi-Interest Network for Click-through Rate Prediction [J].
Xiao, Zhibo ;
Yang, Luwei ;
Jiang, Wen ;
Wei, Yi ;
Hu, Yi ;
Wang, Hao .
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, :2265-2268
[55]   Rethinking Multi-Interest Learning for Candidate Matching in Recommender Systems [J].
Xie, Yueqi ;
Gao, Jingqi ;
Zhou, Peilin ;
Ye, Qichen ;
Hua, Yining ;
Kim, Jae Boum ;
Wu, Fangzhao ;
Kim, Sunghun .
PROCEEDINGS OF THE 17TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2023, 2023, :283-293
[56]  
Yan YM, 2021, Arxiv, DOI arXiv:2105.11741
[57]   HOP-Rec: High-Order Proximity for Implicit Recommendation [J].
Yang, Jheng-Hong ;
Chen, Chih-Ming ;
Wang, Chuan-Ju ;
Tsai, Ming-Feng .
12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS), 2018, :140-144
[58]   Knowledge Graph Contrastive Learning for Recommendation [J].
Yang, Yuhao ;
Huang, Chao ;
Xia, Lianghao ;
Li, Chenliang .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :1434-1443
[59]   Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendation [J].
Yu, Junliang ;
Yin, Hongzhi ;
Xia, Xin ;
Chen, Tong ;
Cui, Lizhen ;
Nguyen, Quoc Viet Hung .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :1294-1303
[60]   Collaborative Knowledge Base Embedding for Recommender Systems [J].
Zhang, Fuzheng ;
Yuan, Nicholas Jing ;
Lian, Defu ;
Xie, Xing ;
Ma, Wei-Ying .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :353-362