Papers › A Temporal Graph Network Framework for Dynamic Recommendation

A Temporal Graph Network Framework for Dynamic Recommendation

24 Mar 2024arXiv:2403.16066archive 2025-07-28

Yejin Kim, Youngbin Lee, Vincent Yuan, Annika Lee, YongJae lee

Recommender systems, crucial for user engagement on platforms like e-commerce and streaming services, often lag behind users' evolving preferences due to static data reliance. After Temporal Graph Networks (TGNs) were proposed, various studies have shown that TGN can significantly improve situations where the features of nodes and edges dynamically change over time. However, despite its promising capabilities, it has not been directly applied in recommender systems to date. Our study bridges this gap by directly implementing Temporal Graph Networks (TGN) in recommender systems, a first in this field. Using real-world datasets and a range of graph and history embedding methods, we show TGN's adaptability, confirming its effectiveness in dynamic recommendation scenarios.

PaperPDFCode

Code

yejining99/TGN_Rec officialpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Recommendation Systems

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

TGN

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections