Social Recommendation through Heterogeneous Graph Modeling of the Long-term and Short-term Preference Defined by Dynamic Time Spans
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Positional Encoding meets Persistent Homology on Graphs
Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning
Similarity-Guided Diffusion for Contrastive Sequential Recommendation
When Graph Contrastive Learning Backfires: Spectral Vulnerability and Defense in Recommendation
Permutation Equivariant Neural Controlled Differential Equations for Dynamic Graph Representation Learning
Wasserstein Hypergraph Neural Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.