End-to-End Graph-Sequential Representation Learning for Accurate Recommendations

Vladimir Baikalov, Evgeny Frolov
3/1/2024
cs.IRcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Recent recommender system advancements have focused on developing sequence-based and graph-based approaches. Both approaches proved useful in modeling intricate relationships within behavioral data, leading to promising outcomes in personalized ranking and next-item recommendation tasks while maintaining good scalability. However, they capture very different signals from data. While the former approach represents users directly through ordered interactions with recent items, the latter aims to capture indirect dependencies across the interactions graph. This paper presents a novel multi-representational learning framework exploiting these two paradigms' synergies. Our empirical evaluation on several datasets demonstrates that mutual training of sequential and graph components with the proposed framework significantly improves recommendations performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{baikalov2024endtoend,
  title  = {End-to-End Graph-Sequential Representation Learning for Accurate Recommendations},
  author = {Vladimir Baikalov and Evgeny Frolov},
  year   = {2024},
  eprint = {2403.00895},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.00895v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.00895.svg)](https://codeofpaper.com/paper/2403.00895)

Discussion