Similitude Attentive Relation Network for Click-Through Rate Prediction

被引:1
作者
Deng, Hangyu [1 ]
Wang, Yulong [1 ]
Luo, Jia [1 ]
Hu, Jinglu [1 ]
机构
[1] Waseda Univ, Grad Sch Informat Prod & Syst, 2-7 Hibikino, Kitakyushu, Fukuoka 8080135, Japan
来源
2020 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN) | 2020年
关键词
recommender systems; online advertising; click-through rate prediction; relation network;
D O I
10.1109/ijcnn48605.2020.9207521
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In online advertising systems, having a good knowledge of user behavior is crucial for click-through rate (CTR) prediction. In recent years, many researchers turn to seek a better way of user representation by modeling the behavior sequences with recurrent neural network (RNN). However, recurrent layers implicitly adopt the assumption that elements with different orders are fundamentally different, which is inefficient in many practical scenarios with much uncertainty and complicated hidden states. In this paper, we follow the paradigm of Relation Network (RN), and propose a new model called Similitude Attentive Relation Network (SARN). The user behavior is modeled as a graph, where nodes correspond to the visited items and edges correspond to the relations. To capture the latent user interest better, the model concentrates on the relations between items, rather than the translation on the time series. More specifically, the model tries to learn the similarity between items in a semantic space through a learnable dotproduct operation and blend both of the item representations and relational information together as the final relations. We define our user representation on an attentive pooling of the relations directly. To verify the effectiveness of our method, extensive experiments on two public datasets and one real-world online advertising dataset are conducted. Experimental results show that our methods achieve usually better performance than others. Besides, we explore the properties of our model by controlled experiments and show the learned relational knowledge by visualizing the inner states of SARN.
引用
收藏
页数:8
相关论文
共 25 条
[1]  
Cao ZC, 2018, IEEE INT CON AUTO SC, P803, DOI 10.1109/COASE.2018.8560578
[2]   Personalized Recommendations using Knowledge Graphs: A Probabilistic Logic Programming Approach [J].
Catherine, Rose ;
Cohen, William .
PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, :325-332
[3]   Estimating Ads' Click through Rate with Recurrent Neural Network [J].
Chen, Qiao-Hong ;
Yu, Shi-Min ;
Guo, Zi-Xuan ;
Jia, Yu-Bo .
3RD ANNUAL INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS (ITA 2016), 2016, 7
[4]  
Chen Qibin, 2019, KDD
[5]  
Cheng Heng-Tze, P 1 WORKSH DEEP LEAR, pUSA, DOI DOI 10.1145/2988450.2988454
[6]   Deep Neural Networks for YouTube Recommendations [J].
Covington, Paul ;
Adams, Jay ;
Sargin, Emre .
PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, :191-198
[7]  
Hariri N., 2012, P 6 ACM C REC SYST, P131, DOI DOI 10.1145/2365952.2365979
[8]  
He X., 2014, Proceedings of the Eighth International Workshop on data Mining for Online Advertising, pp. 1, DOI [10.1145/2648584.2648589, DOI 10.1145/2648584.2648589]
[9]   Relation Networks for Object Detection [J].
Hu, Han ;
Gu, Jiayuan ;
Zhang, Zheng ;
Dai, Jifeng ;
Wei, Yichen .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :3588-3597
[10]   xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems [J].
Lian, Jianxun ;
Zhou, Xiaohuan ;
Zhang, Fuzheng ;
Chen, Zhongxia ;
Xie, Xing ;
Sun, Guangzhong .
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, :1754-1763