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 条
  • [31] Traffic Flow Prediction using Kalman Filtering Technique
    Kumar, Selvaraj Vasantha
    TRANSBALTICA 2017: TRANSPORTATION SCIENCE AND TECHNOLOGY, 2017, 187 : 582 - 587
  • [32] Adaptive Traffic Light Prediction via Kalman Filtering
    Protschky, Valentin
    Wiesner, Kevin
    Feit, Stefan
    2014 IEEE INTELLIGENT VEHICLES SYMPOSIUM PROCEEDINGS, 2014, : 151 - 157
  • [33] Crowd Density Prediction Using Kalman Filtering Technique
    Gayathri, H.
    Karthika, P.S.
    Verma, Ashish
    Lecture Notes in Civil Engineering, 2022, 219 : 161 - 170
  • [34] APPLICATION OF KALMAN FILTERING TO SPACECRAFT RANGE RESIDUAL PREDICTION
    MADRID, GA
    BIERMAN, GJ
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1978, 23 (03) : 430 - 433
  • [35] Electricity consumption prediction based on autoregressive Kalman filtering
    Yang, Zuyuan
    Xie, Zitan
    Huang, Zhiwei
    ELECTRICAL ENGINEERING, 2024,
  • [36] Dynamic financial distress prediction based on Kalman filtering
    Bao, Xinzhong
    Tao, Qiuyan
    Fu, Hongyu
    JOURNAL OF APPLIED STATISTICS, 2015, 42 (02) : 292 - 308
  • [37] Dynamic Prediction of Financial Distress Based on Kalman Filtering
    Zhuang, Qian
    Chen, Lianghua
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2014, 2014
  • [38] Underlying Fundamentals of Kalman Filtering for River Network Modeling
    Emery, Charlotte M.
    David, Cedric H.
    Andreadis, Konstantinos M.
    Turmon, Michael J.
    Reager, John T.
    Hobbs, Jonathan M.
    Pan, Ming
    Famiglietti, James S.
    Beighley, Edward
    Rodell, Matthew
    JOURNAL OF HYDROMETEOROLOGY, 2020, 21 (03) : 453 - 474
  • [39] Kalman's filtering technique in structural equation modeling
    Bolla, Marianna
    Abdelkhalek, Fatma
    STUDIA UNIVERSITATIS BABES-BOLYAI MATHEMATICA, 2021, 66 (01): : 179 - 196