Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Temporal Graph Network Framework for Dynamic Recommendation (2403.16066v2)

Published 24 Mar 2024 in cs.AI

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. A Systematic Study on the Recommender Systems in the E-Commerce. IEEE Access, 8: 115694–115716.
  2. Temporal graph neural networks for social recommendation. In 2020 IEEE International Conference on Big Data (Big Data), 898–903. IEEE.
  3. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555.
  4. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems (TOIS), 22(1): 143–177.
  5. Advances and challenges in conversational recommender systems: A survey. AI Open, 2: 100–126.
  6. Lightgcn: Simplifying and powering graph convolution network for recommendation. In Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 639–648.
  7. Self-attentive sequential recommendation. In 2018 IEEE international conference on data mining (ICDM), 197–206. IEEE.
  8. Learning dynamic embeddings from temporal interactions. arXiv preprint arXiv:1812.02289.
  9. STAMP: short-term attention/memory priority model for session-based recommendation. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, 1831–1839.
  10. BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618.
  11. Temporal Graph Networks for Deep Learning on Dynamic Graphs. arXiv:2006.10637.
  12. BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In Proceedings of the 28th ACM international conference on information and knowledge management, 1441–1450.
  13. Improved recurrent neural networks for session-based recommendations. In Proceedings of the 1st workshop on deep learning for recommender systems, 17–22.
  14. Dyrep: Learning representations over dynamic graphs. In International conference on learning representations.
  15. Temporal network compression via network hashing. arXiv preprint arXiv:2307.04890.
  16. Neural graph collaborative filtering. In Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval, 165–174.
  17. Temporal recommendation on graphs via long-and short-term preference fusion. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 723–732.
  18. Time-interval Aware Share Recommendation via Bi-directional Continuous Time Dynamic Graphs. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 822–831.

Summary

We haven't generated a summary for this paper yet.