Kalman Filtering Attention for User Behavior Modeling in CTR Prediction

被引:0
|
作者
Liu, Hu [1 ]
Lu, Jing [1 ]
Zhao, Xiwei [1 ]
Xu, Sulong [1 ]
Peng, Hao [1 ]
Liu, Yutong [1 ]
Zhang, Zehua [1 ]
Li, Jian [1 ]
Jin, Junsheng [1 ]
Bao, Yongjun [1 ]
Yan, Weipeng [1 ]
机构
[1] JD Com, Business Growth BU, Beijing, Peoples R China
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Click-through rate (CTR) prediction is one of the fundamental tasks for e-commerce search engines. As search becomes more personalized, it is necessary to capture the user interest from rich behavior data. Existing user behavior modeling algorithms develop different attention mechanisms to emphasize query-relevant behaviors and suppress irrelevant ones. Despite being extensively studied, these attentions still suffer from two limitations. First, conventional attentions mostly limit the attention field only to a single user's behaviors, which is not suitable in e-commerce where users often hunt for new demands that are irrelevant to any historical behaviors. Second, these attentions are usually biased towards frequent behaviors, which is unreasonable since high frequency does not necessarily indicate great importance. To tackle the two limitations, we propose a novel attention mechanism, termed Kalman Filtering Attention (KFAtt), that considers the weighted pooling in attention as a maximum a posteriori (MAP) estimation. By incorporating a priori, KFAtt resorts to global statistics when few user behaviors are relevant. Moreover, a frequency capping mechanism is incorporated to correct the bias towards frequent behaviors. Offline experiments on both benchmark and a 10 billion scale real production dataset, together with an Online A/B test, show that KFAtt outperforms all compared state-of-the-arts. KFAtt has been deployed in the ranking system of JD.com, one of the largest B2C e-commerce websites in China, serving the main traffic of hundreds of millions of active users.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] A Non-sequential Approach to Deep User Interest Model for CTR Prediction
    Zhao, Keke
    Zhao, Xing
    Cao, Qi
    Mo, Linjian
    PROCEEDINGS OF THE 2022 SIAM INTERNATIONAL CONFERENCE ON DATA MINING, SDM, 2022, : 531 - 539
  • [42] Modeling Multidimensional User Preferences for Collaborative Filtering
    Khawar, Farhan
    Zhang, Nevin L.
    2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, : 1618 - 1621
  • [43] Modeling user rating profiles for collaborative filtering
    Marlin, B
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16, 2004, 16 : 627 - 634
  • [44] Trilateral Spatiotemporal Attention Network for User Behavior Modeling in Location-based Search
    Qi, Yi
    Hu, Ke
    Zhang, Bo
    Cheng, Jia
    Lei, Jun
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 3373 - 3377
  • [45] Session interest model for CTR prediction based on self-attention mechanism
    Wang, Qianqian
    Liu, Fang'ai
    Zhao, Xiaohui
    Tan, Qiaoqiao
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [46] Session interest model for CTR prediction based on self-attention mechanism
    Qianqian Wang
    Fang’ai Liu
    Xiaohui Zhao
    Qiaoqiao Tan
    Scientific Reports, 12
  • [47] Attention-Based Feature Interaction Deep Factorization Machine for CTR Prediction
    Yang, Peilin
    Han, Yongliang
    Xiao, Yingyuan
    Zheng, Wenguang
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING, ICANN 2023, PART X, 2023, 14263 : 49 - 60
  • [48] Use of GNSS Doppler for Prediction in Kalman Filtering for Smartphone Positioning
    Agarwal, Naman
    O'Keefe, Kyle
    IEEE Journal on Indoor and Seamless Positioning and Navigation, 2023, 1 : 151 - 160
  • [49] DYNAMIC PREDICTION OF TRAFFIC VOLUME THROUGH KALMAN FILTERING THEORY
    OKUTANI, I
    STEPHANEDES, YJ
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1984, 18 (01) : 1 - 11
  • [50] Kalman filtering algorithm for self-similar traffic prediction
    Guo, Qing
    Na, Zhenyu
    Gu, Xuemai
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2009, 43 (04): : 57 - 61