Leveraging recommendations using a multiplex graph database

Abstract

PurposeBy applying targeted graph algorithms, the method used by the authors enables effective prediction of user interactions and thus fulfils the complex requirements of modern recommender systems. This study sets a new benchmark for multidimensional recommendation strategies and offers a path towards more advanced and user-centric models.Design/methodology/approachTo improve multidimensional data recommendation systems, multiplex graph structures are useful to capture various types of user interactions. This paper presents a novel framework that uses a graph database to compute and manipulate multiplex graphs. The approach enables flexible dimension management and increases expressive power through a specialised algebra designed for multiplex graph manipulation.FindingsThe authors compare the multiplex graph approach with traditional matrix methods, in particular random walk with restart, and show that the method not only provides deeper insights into user preferences by integrating scores from different layers of the multiplex graph, but also outperforming matrix-based approaches in most configurations. The results highlight the potential of multiplex graphs for developing sophisticated and customised recommender systems that significantly improve both performance and explainability.Originality/valueThe study provides a formal specification of a multiplex graph construction based on interaction and content-based information; and the study also developed an algebra dedicated to multiplex graphs, enabling robust and precise graph manipulations necessary for effective recommendation queries. The authors implement these algebraic operations within the Neo4j graph database system with a thorough analysis and experimentation with three different data sets, benchmarked against traditional matrix-based methods.