Graph-aware collaborative reasoning for click-through rate prediction

被引:3
作者
Zhang, Xin [1 ]
Wang, Zengmao [1 ]
Du, Bo [1 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430000, Peoples R China
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2023年 / 26卷 / 03期
基金
中国国家自然科学基金;
关键词
click-through rate prediction; collaborative filtering; logical reasoning;
D O I
10.1007/s11280-022-01050-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Click-through rate prediction(CTR) is a critical task in an online advertising system. Recently, deep learning based architectures have brought great attention in Click-through rate prediction by learning the nonlinear interaction between feature embedding of users and items. However, these methods have the following issues: (1) The collaborative information between users and items could not be fully explored due to the static embedding with lookup-table technique. (2) The learning procedure lacks cognitive reasoning about what the users want to do and what they may need. To address the above challenges, we propose a graph aware collaborative reasoning method for CTR prediction which explores the collaborative information with graph and then predicts the users' behaviors with logical reasoning. Specifically, the graph is built by the common behaviors between users, and the embedding of users and items can be learned by propagating the collaborative information in the graph. Then with the collaborative embedding of users and items, two logical operations NOT and OR are adopted to integrate the embedding for logical reasoning with the neural networks. By learning the proposed architecture in an end-to-end manner, the logical behaviors of users in the behavior sequences can be learned efficiently. Extensive experiments on five real-world datasets show that the proposed method outperforms several state-of-the-art methods in CTR prediction.
引用
收藏
页码:967 / 987
页数:21
相关论文
共 41 条
[1]  
Bahdanau D, 2016, Arxiv, DOI [arXiv:1409.0473, 10.48550/arXiv.1409.0473,1409.0473, DOI 10.48550/ARXIV.1409.0473,1409.0473]
[2]   Extending Sample Information for Small Data Set Prediction [J].
Chen, Hung-Yuj ;
Li, Der-Chiang ;
Lin, Liang-Sian .
PROCEEDINGS 2016 5TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS IIAI-AAI 2016, 2016, :710-714
[3]   Effective and Efficient Reuse of Past Travel Behavior for Route Recommendation [J].
Chen, Lisi ;
Shang, Shuo ;
Jensen, Christian S. ;
Yao, Bin ;
Zhang, Zhiwei ;
Shao, Ling .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :488-498
[4]  
Chen LS, 2019, AAAI CONF ARTIF INTE, P873
[5]  
Feng YF, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2301
[6]  
Gori M, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2766
[7]  
Guo HF, 2017, PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P1725
[8]  
Han P., 2021, P 27 ACM SIGKDD C KN
[9]  
Han P, 2020, PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2484
[10]   AUC-MF: Point of Interest Recommendation with AUC Maximization [J].
Han, Peng ;
Shang, Shuo ;
Sun, Aixin ;
Zhao, Peilin ;
Zheng, Kai ;
Kalnis, Panos .
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, :1558-1561