Daniele Malitesta, Alberto Carlo Maria Mancino, Pasquale Minervini, Tommaso Di Noia
{"title":"Dot Product is All You Need: Bridging the Gap Between Item Recommendation and Link Prediction","authors":"Daniele Malitesta, Alberto Carlo Maria Mancino, Pasquale Minervini, Tommaso Di Noia","doi":"arxiv-2409.07433","DOIUrl":null,"url":null,"abstract":"Item recommendation (the task of predicting if a user may interact with new\nitems from the catalogue in a recommendation system) and link prediction (the\ntask of identifying missing links in a knowledge graph) have long been regarded\nas distinct problems. In this work, we show that the item recommendation\nproblem can be seen as an instance of the link prediction problem, where\nentities in the graph represent users and items, and the task consists of\npredicting missing instances of the relation type <<interactsWith>>. In a\npreliminary attempt to demonstrate the assumption, we decide to test three\npopular factorisation-based link prediction models on the item recommendation\ntask, showing that their predictive accuracy is competitive with ten\nstate-of-the-art recommendation models. The purpose is to show how the former\nmay be seamlessly and effectively applied to the recommendation task without\nany specific modification to their architectures. Finally, while beginning to\nunveil the key reasons behind the recommendation performance of the selected\nlink prediction models, we explore different settings for their hyper-parameter\nvalues, paving the way for future directions.","PeriodicalId":501281,"journal":{"name":"arXiv - CS - Information Retrieval","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Item recommendation (the task of predicting if a user may interact with new
items from the catalogue in a recommendation system) and link prediction (the
task of identifying missing links in a knowledge graph) have long been regarded
as distinct problems. In this work, we show that the item recommendation
problem can be seen as an instance of the link prediction problem, where
entities in the graph represent users and items, and the task consists of
predicting missing instances of the relation type <>. In a
preliminary attempt to demonstrate the assumption, we decide to test three
popular factorisation-based link prediction models on the item recommendation
task, showing that their predictive accuracy is competitive with ten
state-of-the-art recommendation models. The purpose is to show how the former
may be seamlessly and effectively applied to the recommendation task without
any specific modification to their architectures. Finally, while beginning to
unveil the key reasons behind the recommendation performance of the selected
link prediction models, we explore different settings for their hyper-parameter
values, paving the way for future directions.