mlsanityData to 14 Oct 2026

RETE: Retrieval-Enhanced Temporal Event Forecasting on Unified Query Product Evolutionary Graph

arXiv 2202.06129 ↗First posted 12 Feb 2022cs.IR cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

With the increasing demands on e-commerce platforms, numerous user action history is emerging. Those enriched action records are vital to understand users' interests and intents. Recently, prior works for user behavior prediction mainly focus on the interactions with product-side information. However, the interactions with search queries, which usually act as a bridge between users and products, are still under investigated. In this paper, we explore a new problem named temporal event forecasting, a generalized user behavior prediction task in a unified query product evolutionary graph, to embrace both query and product recommendation in a temporal manner. To fulfill this setting, there involves two challenges: (1) the action data for most users is scarce; (2) user preferences are dynamically evolving and shifting over time. To tackle those issues, we propose a novel Retrieval-Enhanced Temporal Event (RETE) forecasting framework. Unlike existing methods that enhance user representations via roughly absorbing information from connected entities in the whole graph, RETE efficiently and dynamically retrieves relevant entities centrally on each user as high-quality subgraphs, preventing the noise propagation from the densely evolutionary graph structures that incorporate abundant search queries. And meanwhile, RETE autoregressively accumulates retrieval-enhanced user representations from each time step, to capture evolutionary patterns for joint query and product prediction. Empirically, extensive experiments on both the public benchmark and four real-world industrial datasets demonstrate the effectiveness of the proposed RETE method.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 30 of its 60 references that are in the map. First posted on arXiv 12 Feb 2022.

Builds on

30 of 60 references.

References · 30

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  5. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  6. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 964
  7. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
  8. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 343
  9. 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
  10. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 278
  11. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  12. 2020Scaling Graph Neural Networks with Approximate PageRankcited by 174
18 more
  1. 2017Recurrent Neural Networks with Top-k Gains for Session-based Recommendationscited by 165
  2. 2018RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systemscited by 138
  3. 2021HDMI: High-order Deep Multiplex Infomaxcited by 82
  4. 2019Session-based Social Recommendation via Dynamic Graph Attention Networkscited by 76
  5. 2017Automated Phrase Mining from Massive Text Corporacited by 70
  6. 2020Revisiting Over-smoothing in Deep GCNscited by 55
  7. 2020How to Retrain Recommender System? A Sequential Meta-Learning Methodcited by 42
  8. 2020Interactive Recommender System via Knowledge Graph-enhanced Reinforcement Learningcited by 40
  9. 2018Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendationcited by 39
  10. 2021Interest-aware Message-Passing GCN for Recommendationcited by 39
  11. 2021Network of Tensor Time Seriescited by 32
  12. 2018AceKG: A Large-scale Knowledge Graph for Academic Data Miningcited by 28
  13. 2021DyDiff-VAE: A Dynamic Variational Framework for Information Diffusion Predictioncited by 18
  14. 2020Deep Graph Neural Networks with Shallow Subgraph Samplerscited by 16
  15. 2019Context Attentive Document Ranking and Query Suggestioncited by 15
  16. 2019Sequential Recommendation with Dual Side Neighbor-based Collaborative Relation Modelingcited by 11
  17. 2020Author Name Disambiguation on Heterogeneous Information Network with Adversarial Representation Learningcited by 7
  18. 2020Hierarchical Overlapping Belief Estimation by Structured Matrix Factorizationcited by 5

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 4; 2024: 3; 2025: 2.

11 papers.