Ecole d'ingénieur et centre de recherche en Sciences du numérique

Knowledge graph embeddings with node2vec for item recommendation

Palumbo, Enrico; Rizzo, Giuseppe; Troncy, Raphaël; Baralis, Elena; Osella, Michele; Ferro, Enrico

ESWC 2018, 15th European Semantic Web Conference, 3-7 June 2018, Heraklion, Crete, Greece

Best Poster Award

In the past years, knowledge graphs have proven to be beneficial for recommender systems, efficiently addressing paramount issues such as new items and data sparsity. Graph embeddings algorithms have shown to be able to automatically learn high quality feature vectors from graph structures, enabling vector-based measures of node relatedness. In this paper, we show how node2vec can be used to generate item recommendations by learning knowledge graph embeddings. We apply node2vec on a knowledge graph built from the MovieLens 1M dataset and DBpedia and use the node relatedness to generate item recommendations. The results show that node2vec consistently outperforms a set of collaborative filtering baselines on an array of relevant metrics.

Document Doi Bibtex

Titre:Knowledge graph embeddings with node2vec for item recommendation
Mots Clés:Knowledge Graphs Embeddings, Recommender Systems, node2vec
Type:Poster / Demo
Langue:English
Ville:Heraklion
Pays:GRÈCE
Date:
Département:Data Science
Eurecom ref:5583
Copyright: © Springer. Personal use of this material is permitted. The definitive version of this paper was published in ESWC 2018, 15th European Semantic Web Conference, 3-7 June 2018, Heraklion, Crete, Greece and is available at : http://doi.org/10.1007/978-3-319-98192-5_22
Bibtex: @poster / demo{EURECOM+5583, year = {2018}, title = {{K}nowledge graph embeddings with node2vec for item recommendation}, author = {{P}alumbo, {E}nrico and {R}izzo, {G}iuseppe and {T}roncy, {R}apha{\"e}l and {B}aralis, {E}lena and {O}sella, {M}ichele and {F}erro, {E}nrico}, number = {EURECOM+5583}, month = {06}, institution = {Eurecom} address = {{H}eraklion, {GR}{\`{E}}{CE}}, url = {http://www.eurecom.fr/publication/5583} }
Voir aussi: