Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction
Not on the map. Why?
Abstract (arXiv)
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. Modeling such an 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 an 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 modeling of multiple dimensional hierarchies, 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 user interests at different dimensions (e.g. category, price, or brand).To validate our model, a simplified DHAN has applied to Click-Through Rate (CTR) prediction and our experimental results on three public datasets with two levels of the one-dimensional hierarchy only by category. It shows the superiority of DHAN 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 a combination of DHAN and DIEN to model both temporal and hierarchical interests.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 0; 2025: 0; 2026: 1.
10 papers.
- 2021End-to-End User Behavior Retrieval in Click-Through RatePrediction Modelcited by 45
- 2022What is Next when Sequential Prediction Meets Implicitly Hard Interaction?cited by 4
- 2021DMBGN: Deep Multi-Behavior Graph Networks for Voucher Redemption Rate Predictioncited by 3
- 2022Efficient Long Sequential User Data Modeling for Click-Through Rate Predictioncited by 3
- 2023Deep Context Interest Network for Click-Through Rate Predictioncited by 2
- 2021MOEF: Modeling Occasion Evolution in Frequency Domain for Promotion-Aware Click-Through Rate Predictioncited by 1
- 2022Deep Multi-Representation Model for Click-Through Rate Predictioncited by 0
- 2023DPAN: Dynamic Preference-based and Attribute-aware Network for Relevant Recommendationscited by 0
- 2023Deep Group Interest Modeling of Full Lifelong User Behaviors for CTR Predictioncited by 0
- 2026Generative Long-term User Interest Modeling for Click-Through Rate Predictioncited by 0
- 2026Generative Long-term User Interest Modeling for Click-Through Rate Prediction15 May 2026
- 2023Deep Group Interest Modeling of Full Lifelong User Behaviors for CTR Prediction15 Nov 2023
- 2023DPAN: Dynamic Preference-based and Attribute-aware Network for Relevant Recommendations21 Aug 2023
- 2023Deep Context Interest Network for Click-Through Rate Prediction11 Aug 2023
- 2022Deep Multi-Representation Model for Click-Through Rate Prediction18 Oct 2022
- 2022Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction25 Sep 2022
- 2022What is Next when Sequential Prediction Meets Implicitly Hard Interaction?14 Feb 2022
- 2021MOEF: Modeling Occasion Evolution in Frequency Domain for Promotion-Aware Click-Through Rate Prediction27 Dec 2021
- 2021End-to-End User Behavior Retrieval in Click-Through RatePrediction Model10 Aug 2021
- 2021DMBGN: Deep Multi-Behavior Graph Networks for Voucher Redemption Rate Prediction7 Jun 2021