Multi-interest Extraction Joint with Contrastive Learning for News Recommendation

被引:2
作者
Wang, Shicheng [1 ,2 ]
Guo, Shu [3 ]
Wang, Lihong
Liu, Tingwen [1 ,2 ]
Xu, Hongbo [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing, Peoples R China
[3] Coordinat Ctr China, Natl Comp Network Emergency Response Tech Team, Beijing, Peoples R China
来源
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT I | 2023年 / 13713卷
基金
中国国家自然科学基金;
关键词
News recommendation; Multi-interest extraction; Contrastive learning;
D O I
10.1007/978-3-031-26387-3_37
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
News recommendation techniques aim to recommend candidate news to target user that he may be interested in, according to his browsed historical news. At present, existing works usually tend to represent user reading interest using a single vector during the modeling procedure. Actually, it is obviously that users usually have multiple and diverse interest in reality, such as sports, entertainment and so on. Thus it is irrational to represent user sophisticated semantic interest simply utilizing a single vector, which may conceal fine-grained information. In this work, we propose a novel method combining multi-interest extraction with contrastive learning, named MIECL, to tackle the above problem. Specifically, first, we construct several interest prototypes and design a multi-interest user encoder to learn multiple user representations under different interest conditions simultaneously. Then we adopt a graph-enhanced user encoder to enrich user corresponding semantic representation under each interest background through aggregating relevant information from neighbors. Finally, we contrast user multi-interest representations and interest prototype vectors to optimize the user representations themselves, in order to promote dissimilar semantic interest away from each other. We conduct experiments on two real-world news recommendation datasets MIND-Large, MIND-Small and empirical results demonstrate the effectiveness of our approach from multiple perspectives.
引用
收藏
页码:606 / 621
页数:16
相关论文
共 23 条
[1]  
An MX, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P336
[2]  
Chen T, 2020, PR MACH LEARN RES, V119
[3]  
Das A. S., 2007, WWW, V271-280, DOI DOI 10.1145/1242572.1242610
[4]  
Devlin J, 2019, Arxiv, DOI arXiv:1810.04805
[5]   Graph Enhanced Representation Learning for News Recommendation [J].
Ge, Suyu ;
Wu, Chuhan ;
Wu, Fangzhao ;
Qi, Tao ;
Huang, Yongfeng .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :2863-2869
[6]  
Hjelm R.D., 2018, INT C LEARNING REPRE
[7]   Graph neural news recommendation with long-term and short-term interest modeling [J].
Hu, Linmei ;
Li, Chen ;
Shi, Chuan ;
Yang, Cheng ;
Shao, Chao .
INFORMATION PROCESSING & MANAGEMENT, 2020, 57 (02)
[8]   Weave&Rec : AWord Embedding based 3-D Convolutional Network for News Recommendation [J].
Khattar, Dhruv ;
Kumar, Vaibhav ;
Varma, Vasudeva ;
Gupta, Manish .
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, :1855-1858
[9]   KRED: Knowledge-Aware Document Representation for News Recommendations [J].
Liu, Danyang ;
Lian, Jianxun ;
Wang, Shiyin ;
Qiao, Ying ;
Chen, Jiun-Hung ;
Sun, Guangzhong ;
Xie, Xing .
RECSYS 2020: 14TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2020, :200-209
[10]   Embedding-based News Recommendation for Millions of Users [J].
Okura, Shumpei ;
Tagami, Yukihiro ;
Ono, Shingo ;
Tajima, Akira .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :1933-1942