Graph Convolutional Embeddings for Recommender Systems
Paula G\'omez Duran, Alexandros Karatzoglou, Jordi Vitri\`a, Xin Xin,, Ioannis Arapakis

TL;DR
This paper introduces a generalized graph convolutional embedding layer for N-partite graphs, enhancing recommender systems by incorporating multiple context dimensions into user-item interaction modeling.
Contribution
It proposes a novel GCN-based embedding layer for N-partite graphs that seamlessly integrates multiple context signals into deep learning recommender architectures.
Findings
Improved recommendation performance on multiple datasets
Effective incorporation of context dimensions in embeddings
Demonstrated benefits in drug re-purposing tasks
Abstract
Modern recommender systems (RS) work by processing a number of signals that can be inferred from large sets of user-item interaction data. The main signal to analyze stems from the raw matrix that represents interactions. However, we can increase the performance of RS by considering other kinds of signals like the context of interactions, which could be, for example, the time or date of the interaction, the user location, or sequential data corresponding to the historical interactions of the user with the system. These complex, context-based interaction signals are characterized by a rich relational structure that can be represented by a multi-partite graph. Graph Convolutional Networks (GCNs) have been used successfully in collaborative filtering with simple user-item interaction data. In this work, we generalize the use of GCNs for N-partite graphs by considering N multiple context…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Convolutional Networks · Graph Convolutional Network
