mlsanityData to 14 Oct 2026

Hierarchically Fusing Long and Short-Term User Interests for Click-Through Rate Prediction in Product Search

arXiv 2304.02089 ↗First posted 4 Apr 2023cs.IR cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Estimating Click-Through Rate (CTR) is a vital yet challenging task in personalized product search. However, existing CTR methods still struggle in the product search settings due to the following three challenges including how to more effectively extract users' short-term interests with respect to multiple aspects, how to extract and fuse users' long-term interest with short-term interests, how to address the entangling characteristic of long and short-term interests. To resolve these challenges, in this paper, we propose a new approach named Hierarchical Interests Fusing Network (HIFN), which consists of four basic modules namely Short-term Interests Extractor (SIE), Long-term Interests Extractor (LIE), Interests Fusion Module (IFM) and Interests Disentanglement Module (IDM). Specifically, SIE is proposed to extract user's short-term interests by integrating three fundamental interests encoders within it namely query-dependent, target-dependent and causal-dependent interest encoder, respectively, followed by delivering the resultant representation to the module LIE, where it can effectively capture user long-term interests by devising an attention mechanism with respect to the short-term interests from SIE module. In IFM, the achieved long and short-term interests are further fused in an adaptive manner, followed by concatenating it with original raw context features for the final prediction result. Last but not least, considering the entangling characteristic of long and short-term interests, IDM further devises a self-supervised framework to disentangle long and short-term interests. Extensive offline and online evaluations on a real-world e-commerce platform demonstrate the superiority of HIFN over state-of-the-art methods.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 4 Apr 2023.

Builds on

17 of 34 references.

References · 17

  1. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,304
  2. 2016Wide & Deep Learning for Recommender Systemscited by 747
  3. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
  4. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
  5. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
  6. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
  7. 2021Towards Causal Representation Learningcited by 209
  8. 2021Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learningcited by 177
  9. 2020Empowering Things with Intelligence: A Survey of the Progress, Challenges, and Opportunities in Artificial Intelligence of Thingscited by 111
  10. 2021Embedding-based Product Retrieval in Taobao Searchcited by 51
  11. 2021FM2: Field-matrixed Factorization Machines for Recommender Systemscited by 31
  12. 2021SAR-Net: A Scenario-Aware Ranking Network for Personalized Fair Recommendation in Hundreds of Travel Scenarioscited by 23
5 more
  1. 2022Disentangling Long and Short-Term Interests for Recommendationcited by 22
  2. 2020A Transformer-based Embedding Model for Personalized Product Searchcited by 16
  3. 2019A Zero Attention Model for Personalized Product Searchcited by 15
  4. 2018Attentive Long Short-Term Preference Modeling for Personalized Product Searchcited by 13
  5. 2022Deep Interest Highlight Network for Click-Through Rate Prediction in Trigger-Induced Recommendationcited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.

3 papers.