Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction

被引:24
|
作者
Xu, Weinan [1 ]
He, Hengxu [1 ]
Tan, Minshi [1 ]
Li, Yunming [1 ]
Lang, Jun [1 ]
Guo, Dongbai [1 ]
机构
[1] Alibaba Grp, Hangzhou, Peoples R China
关键词
Click-Through Rate Prediction; Hierarchical Pattern; Hierarchical Attention Network; Recommendation;
D O I
10.1145/3397271.3401310
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deep Interest Network (DIN) is a state-of-the-art model which uses attention mechanism to capture user interests from historical behaviors. User interests intuitively follow a hierarchical pattern such that users generally show interests from a higher-level then to a lower-level abstraction. Modelling such interest hierarchy in an attention network can fundamentally improve the representation of user behaviors. We therefore propose an improvement over DIN to model arbitrary interest hierarchy: Deep Interest with Hierarchical Attention Network (DHAN). In this model, a multi-dimensional hierarchical structure is introduced on the first attention layer which attends to individual item, and the subsequent attention layers in the same dimension attend to higher-level hierarchy built on top of the lower corresponding layers. To enable modelling of multiple dimensional hierarchy, an expanding mechanism is introduced to capture one to many hierarchies. This design enables DHAN to attend different importance to different hierarchical abstractions thus can fully capture a user's interests at different dimensions (e.g. category, price or brand). To validate our model, a simplified DHAN is applied to Click-Through Rate (CTR) prediction and our experimental results on three public datasets with two levels of one-dimensional hierarchy only by category. It shows DHAN's superiority with significant AUC uplift from 12% to 21% over DIN. DHAN is also compared with another state-of-the-art model Deep Interest Evolution Network (DIEN), which models temporal interest. The simplified DHAN also gets slight AUC uplift from 1.0% to 1.7% over DIEN. A potential future work can be combination of DHAN and DIEN to model both temporal and hierarchical interests.
引用
收藏
页码:1905 / 1908
页数:4
相关论文
共 50 条
  • [1] Deep Interest Network for Click-Through Rate Prediction
    Zhou, Guorui
    Zhu, Xiaoqiang
    Song, Chengru
    Fan, Ying
    Zhu, Han
    Ma, Xiao
    Yan, Yanghui
    Jin, Junqi
    Li, Han
    Gai, Kun
    [J]. KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 1059 - 1068
  • [2] Deep Interest Evolution Network for Click-Through Rate Prediction
    Zhou, Guorui
    Mou, Na
    Fan, Ying
    Pi, Qi
    Bian, Weijie
    Zhou, Chang
    Zhu, Xiaoqiang
    Gai, Kun
    [J]. THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 5941 - 5948
  • [3] Deep Context Interest Network for Click-Through Rate Prediction
    Hou, Xuyang
    Wang, Zhe
    Liu, Qi
    Qu, Tan
    Cheng, Jia
    Lei, Jun
    [J]. PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023, 2023, : 3948 - 3952
  • [4] Deep Session Interest Network for Click-Through Rate Prediction
    Feng, Yufei
    Lv, Fuyu
    Shen, Weichen
    Wang, Menghan
    Sun, Fei
    Zhu, Yu
    Yang, Keping
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 2301 - 2307
  • [5] Deep Multi-Interest Network for Click-through Rate Prediction
    Xiao, Zhibo
    Yang, Luwei
    Jiang, Wen
    Wei, Yi
    Hu, Yi
    Wang, Hao
    [J]. CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 2265 - 2268
  • [6] DDIN: Deep Disentangled Interest Network for Click-Through Rate Prediction
    Yao, Xin-Wei
    He, Chuan
    Xing, Wei-Wei
    Lu, Qi-Chao
    Zhang, Xin-Ge
    Zhang, Yu-Chen
    [J]. 2023 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, IJCNN, 2023,
  • [7] Interpretable Click-Through Rate Prediction through Hierarchical Attention
    Li, Zeyu
    Cheng, Wei
    Chen, Yang
    Chen, Haifeng
    Wang, Wei
    [J]. PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 313 - 321
  • [8] Deep Interest Context Network for Click-Through Rate
    Yu, Mingting
    Liu, Tingting
    Yin, Jian
    Chai, Peilin
    [J]. APPLIED SCIENCES-BASEL, 2022, 12 (19):
  • [9] Core Interest Network for Click-Through Rate Prediction
    Xu, En
    Yu, Zhiwen
    Guo, Bin
    Cui, Helei
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2021, 15 (02)
  • [10] Hierarchical attention and feature projection for click-through rate prediction
    Jinjin Zhang
    Chengliang Zhong
    Shouxiang Fan
    Xiaodong Mu
    Zhen Ni
    [J]. Applied Intelligence, 2022, 52 : 8651 - 8663