User Behavior Retrieval for Click-Through Rate Prediction

被引:65
作者
Qin, Jiarui [1 ]
Zhang, Weinan [1 ]
Wu, Xin [1 ]
Jin, Jiarui [1 ]
Fang, Yuchen [1 ]
Yu, Yong [1 ]
机构
[1] Shanghai Jiao Tong Univ, Shanghai, Peoples R China
来源
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20) | 2020年
基金
中国国家自然科学基金;
关键词
CTR Prediction; Information Retrieval; Sequential User Behavior Modeling;
D O I
10.1145/3397271.3401440
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Click-through rate (CTR) prediction plays a key role in modern online personalization services. In practice, it is necessary to capture user's drifting interests by modeling sequential user behaviors to build an accurate CFR prediction model. However, as the users accumulate more and more behavioral data on the platforms, it becomes non-trivial for the sequential models to make use of the whole behavior history of each user. First, directly feeding the long behavior sequence will make online inference time and system load infeasible. Second, there is much noise in such long histories to fail the sequential model learning. The current industrial solutions mainly truncate the sequences and just feed recent behaviors to the prediction model, which leads to a problem that sequential patterns such as periodicity or long-term dependency are not embedded in the recent several behaviors but in tar back history. To tackle these issues, in this paper we consider it from the data perspective instead of just designing more sophisticated yet complicated models and propose User Behavior Retrieval for CTR prediction (UBR4CTR) framework. In UBR4CTR, the most relevant and appropriate user behaviors will be firstly retrieved from the entire user history sequence using a learnable search method. These retrieved behaviors are then fed into a deep model to make the final prediction instead of simply using the most recent ones. It is highly feasible to deploy UBR4CTR into industrial model pipeline with low cost. Experiments on three real-world large-scale datasets demonstrate the superiority and efficacy of our proposed framework and models.
引用
收藏
页码:2347 / 2356
页数:10
相关论文
共 46 条
  • [1] Agarwal Deepak, 2009, P 18 INT C WORLD WID, DOI [10.1145/1526709.1526713, DOI 10.1145/1526709.1526713]
  • [2] Anh-Phuong TA, 2015, PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIG DATA, P2889, DOI 10.1109/BigData.2015.7364112
  • [3] Latent Cross: Making Use of Context in Recurrent Recommender Systems
    Beutel, Alex
    Covington, Paul
    Jain, Sagar
    Xu, Can
    Li, Jia
    Gatto, Vince
    Chi, Ed H.
    [J]. WSDM'18: PROCEEDINGS OF THE ELEVENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2018, : 46 - 54
  • [4] Sequential Recommendation with User Memory Networks
    Chen, Xu
    Xu, Hongteng
    Zhang, Yongfeng
    Tang, Jiaxi
    Cao, Yixin
    Qin, Zheng
    Zha, Hongyuan
    [J]. WSDM'18: PROCEEDINGS OF THE ELEVENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2018, : 108 - 116
  • [5] Cheng H.-T., 2016, P 1 WORKSH DEEP LEAR, P7
  • [6] Collaborative Memory Network for Recommendation Systems
    Ebesu, Travis
    Shen, Bin
    Fang, Yi
    [J]. ACM/SIGIR PROCEEDINGS 2018, 2018, : 515 - 524
  • [7] Graves A., 2014, Neural Turing Machines. pages
  • [8] Guo HF, 2017, PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P1725
  • [9] Vista: A Visually, Socially, and Temporally-aware Model for Artistic Recommendation
    He, Ruining
    Fang, Chen
    Wang, Zhaowen
    McAuley, Julian
    [J]. PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, : 309 - 316
  • [10] He RN, 2016, IEEE DATA MINING, P191, DOI [10.1109/ICDM.2016.0030, 10.1109/ICDM.2016.88]