mlsanityData to 7 Oct 2026

Social Recommendation through Heterogeneous Graph Modeling of the Long-term and Short-term Preference Defined by Dynamic Time Spans

arXiv 2312.14306 ↗First posted 21 Dec 2023cs.SI cs.AI cs.CEcited by 0

Not on the map. Why?

Abstract (arXiv)

Social recommendations have been widely adopted in substantial domains. Recently, graph neural networks (GNN) have been employed in recommender systems due to their success in graph representation learning. However, dealing with the dynamic property of social network data is a challenge. This research presents a novel method that provides social recommendations by incorporating the dynamic property of social network data in a heterogeneous graph. The model aims to capture user preference over time without going through the complexities of a dynamic graph by adding period nodes to define users' long-term and short-term preferences and aggregating assigned edge weights. The model is applied to real-world data to argue its superior performance. Promising results demonstrate the effectiveness of this model.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 33 references that are in the map. First posted on arXiv 21 Dec 2023.

Builds on

11 of 33 references.

References · 11

  1. 2017Graph Attention Networkscited by 8,854
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  3. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  4. 2017Neural Collaborative Filteringcited by 1,108
  5. 2019Graph Neural Networks for Social Recommendationcited by 711
  6. 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
  7. 2017Deep Learning based Recommender System: A Survey and New Perspectivescited by 136
  8. 2020Random Walks: A Review of Algorithms and Applicationscited by 38
  9. 2018Next Item Recommendation with Self-Attentioncited by 15
  10. 2020Graph Learning Approaches to Recommender Systems: A Reviewcited by 4
  11. 2018Detecting Changes in User Preferences using Hidden Markov Models for Sequential Recommendation Taskscited by 2

Built on by

Not cited yet.