2022/09/09 by Theis E. Jendal, Jendal, Theis E., Matteo Lissandrini +5
Computer Science · #Advanced Graph Neural Networks #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Recommender Systems and Techniques #Topic Modeling #cs.IR
paper · pdf · doi:10.48550/arxiv.2209.04185
openalex publication_date 2022/09/09 · arxiv created 2022/09/13 · arxiv updated 2022/09/14 · openalex created_date 2022/09/15 · openalex updated_date 2026/07/28
Using graph models with relational information in recommender systems has shown promising results. Yet, most methods are transductive, i.e., they are based on dimensionality reduction architectures. Hence, they require heavy retraining every time new items or users are added. Conversely, inductive methods promise to solve these issues. Nonetheless, all inductive methods rely only on interactions, making recommendations for users with few interactions sub-optimal and even impossible for new items. Therefore, we focus on inductive methods able to also exploit knowledge graphs (KGs). In this work, we propose SimpleRec, a strong baseline that uses a graph neural network and a KG to provide better recommendations than related inductive methods for new users and items. We show that it is unnecessary to create complex model architectures for user representations, but it is enough to allow users to be represented by the few ratings they provide and the indirect connections among them without any user metadata. As a result, we re-evaluate state-of-the-art methods, identify better evaluation protocols, highlight unwarranted conclusions from previous proposals, and showcase a novel, stronger baseline for this task.