Collaborative filtering grounded on knowledge graphs

•Introduces a knowledge-aware collaborative filtering method that builds on matrix factorization.•Exploits the vast amount of structured information in knowledge graphs.•The generic representations of users and items to solve the implicit recommendation task.•Empirical study shows impressive results...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Pattern recognition letters 2021-11, Vol.151, p.55-61
Hauptverfasser: Chen, Ya, Mensah, Samuel, Ma, Fei, Wang, Hao, Jiang, Zhongan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Introduces a knowledge-aware collaborative filtering method that builds on matrix factorization.•Exploits the vast amount of structured information in knowledge graphs.•The generic representations of users and items to solve the implicit recommendation task.•Empirical study shows impressive results in sparsity of user-item interactions. Matrix Factorization (MF) is a widely used collaborative filtering technique for effectively modeling a user-item interaction in recommender system. Despite the successful application of MF and its variants, the method proves to be effective only in situations where there is an abundance of user-item interactions. However, user-item interaction data are usually sparse, limiting the effectiveness of the method. In addressing this problem, recent methods have proposed to use knowledge graphs (KGs) as additional information to complement the sparse user-item interaction data. This has proved challenging given the complexity of the KG structure. In this paper, we propose a collaborative filtering method that takes advantage of knowledge graphs. More specifically, the embedding of a user and item are both grounded on the item’s attributes in the knowledge graph, and are aggregated with generic user and item representations modeled by MF for implicit recommendation. Our model has demonstrated to outperform the recent state-of-the-art method KGCN [18] in very sparse settings, showing an effective integration of KGs in recommender systems.
ISSN:0167-8655
1872-7344
DOI:10.1016/j.patrec.2021.07.022