mlsanityData to 7 Oct 2026

DynLLM: When Large Language Models Meet Dynamic Graph Recommendation

arXiv 2405.07580 ↗First posted 13 May 2024cs.IR cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

Last year has witnessed the considerable interest of Large Language Models (LLMs) for their potential applications in recommender systems, which may mitigate the persistent issue of data sparsity. Though large efforts have been made for user-item graph augmentation with better graph-based recommendation performance, they may fail to deal with the dynamic graph recommendation task, which involves both structural and temporal graph dynamics with inherent complexity in processing time-evolving data. To bridge this gap, in this paper, we propose a novel framework, called DynLLM, to deal with the dynamic graph recommendation task with LLMs. Specifically, DynLLM harnesses the power of LLMs to generate multi-faceted user profiles based on the rich textual features of historical purchase records, including crowd segments, personal interests, preferred categories, and favored brands, which in turn supplement and enrich the underlying relationships between users and items. Along this line, to fuse the multi-faceted profiles with temporal graph embedding, we engage LLMs to derive corresponding profile embeddings, and further employ a distilled attention mechanism to refine the LLM-generated profile embeddings for alleviating noisy signals, while also assessing and adjusting the relevance of each distilled facet embedding for seamless integration with temporal graph embedding from continuous time dynamic graphs (CTDGs). Extensive experiments on two real e-commerce datasets have validated the superior improvements of DynLLM over a wide range of state-of-the-art baseline methods.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 25 of its 45 references that are in the map. First posted on arXiv 13 May 2024.

Builds on

25 of 45 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  5. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  6. 2017Neural Collaborative Filteringcited by 1,108
  7. 2019Neural Graph Collaborative Filteringcited by 660
  8. 2015LINE: Large-scale Information Network Embeddingcited by 582
  9. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  10. 2020Inductive Representation Learning on Temporal Graphscited by 454
  11. 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
  12. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
13 more
  1. 2023A Survey on Large Language Models for Recommendationcited by 378
  2. 2023TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendationcited by 336
  3. 2023Large Language Models are Zero-Shot Rankers for Recommender Systemscited by 307
  4. 2020Self-supervised Graph Learning for Recommendationcited by 305
  5. 2023Chat-REC: Towards Interactive and Explainable LLMs-Augmented Recommender Systemcited by 241
  6. 2023TEST: Text Prototype Aligned Embedding to Activate LLM's Ability for Time Seriescited by 165
  7. 2022Towards Unified Conversational Recommender Systems via Knowledge-Enhanced Prompt Learningcited by 85
  8. 2019A Neural Influence Diffusion Model for Social Recommendationcited by 69
  9. 2019Temporal Network Embedding with Micro- and Macro-dynamicscited by 51
  10. 2023Exploring Large Language Model for Graph Data Understanding in Online Job Recommendationscited by 45
  11. 2023Adaptive Graph Contrastive Learning for Recommendationcited by 31
  12. 2023Heterogeneous Graph Contrastive Learning for Recommendationcited by 28
  13. 2021Drug Package Recommendation via Interaction-aware Graph Inductioncited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 5; 2026: 1.

11 papers.