Hybrid music recommendation with graph neural networks

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, CYBERNETICS
Matej Bevec, Marko Tkalčič, Matevž Pesek
{"title":"Hybrid music recommendation with graph neural networks","authors":"Matej Bevec, Marko Tkalčič, Matevž Pesek","doi":"10.1007/s11257-024-09410-4","DOIUrl":null,"url":null,"abstract":"<p>Modern music streaming services rely on recommender systems to help users navigate within their large collections. Collaborative filtering (CF) methods, that leverage past user–item interactions, have been most successful, but have various limitations, like performing poorly among sparsely connected items. Conversely, content-based models circumvent the data-sparsity issue by recommending based on item content alone, but have seen limited success. Recently, graph-based machine learning approaches have shown, in other domains, to be able to address the aforementioned issues. Graph neural networks (GNN) in particular promise to learn from both the complex relationships within a user interaction graph, as well as content to generate hybrid recommendations. Here, we propose a music recommender system using a state-of-the-art GNN, PinSage, and evaluate it on a novel Spotify dataset against traditional CF, graph-based CF and content-based methods on a related song prediction task, venturing beyond accuracy in our evaluation. Our experiments show that (i) our approach is among the top performers and stands out as the most well rounded compared to baselines, (ii) graph-based CF methods outperform matrix-based CF approaches, suggesting that user interaction data may be better represented as a graph and (iii) in our evaluation, CF methods do not exhibit a performance drop in the long tail, where the hybrid approach does not offer an advantage.\n</p>","PeriodicalId":49388,"journal":{"name":"User Modeling and User-Adapted Interaction","volume":"5 1","pages":""},"PeriodicalIF":3.0000,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"User Modeling and User-Adapted Interaction","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11257-024-09410-4","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Modern music streaming services rely on recommender systems to help users navigate within their large collections. Collaborative filtering (CF) methods, that leverage past user–item interactions, have been most successful, but have various limitations, like performing poorly among sparsely connected items. Conversely, content-based models circumvent the data-sparsity issue by recommending based on item content alone, but have seen limited success. Recently, graph-based machine learning approaches have shown, in other domains, to be able to address the aforementioned issues. Graph neural networks (GNN) in particular promise to learn from both the complex relationships within a user interaction graph, as well as content to generate hybrid recommendations. Here, we propose a music recommender system using a state-of-the-art GNN, PinSage, and evaluate it on a novel Spotify dataset against traditional CF, graph-based CF and content-based methods on a related song prediction task, venturing beyond accuracy in our evaluation. Our experiments show that (i) our approach is among the top performers and stands out as the most well rounded compared to baselines, (ii) graph-based CF methods outperform matrix-based CF approaches, suggesting that user interaction data may be better represented as a graph and (iii) in our evaluation, CF methods do not exhibit a performance drop in the long tail, where the hybrid approach does not offer an advantage.

Abstract Image

图神经网络混合音乐推荐
现代音乐流媒体服务依赖于推荐系统来帮助用户浏览其庞大的音乐收藏。协作过滤(CF)方法利用了用户与项目之间过去的互动,是最成功的方法,但也有各种局限性,比如在连接稀疏的项目中表现不佳。与此相反,基于内容的模型通过仅根据项目内容进行推荐来规避数据稀疏性问题,但成功率有限。最近,基于图的机器学习方法在其他领域显示出能够解决上述问题。尤其是图神经网络(GNN),有望从用户交互图中的复杂关系以及内容中学习,从而生成混合推荐。在此,我们提出了一个使用最先进的图神经网络 PinSage 的音乐推荐系统,并在新颖的 Spotify 数据集上对其进行了评估,在相关歌曲预测任务中与传统的 CF、基于图的 CF 和基于内容的方法进行了比较,在评估中超越了准确性。我们的实验表明:(i) 我们的方法是表现最好的方法之一,与基线方法相比是最全面的;(ii) 基于图的 CF 方法优于基于矩阵的 CF 方法,这表明用户交互数据可以更好地表示为图;(iii) 在我们的评估中,CF 方法在长尾部分没有表现出性能下降,而混合方法在长尾部分没有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
User Modeling and User-Adapted Interaction
User Modeling and User-Adapted Interaction 工程技术-计算机:控制论
CiteScore
8.90
自引率
8.30%
发文量
35
审稿时长
>12 weeks
期刊介绍: User Modeling and User-Adapted Interaction provides an interdisciplinary forum for the dissemination of novel and significant original research results about interactive computer systems that can adapt themselves to their users, and on the design, use, and evaluation of user models for adaptation. The journal publishes high-quality original papers from, e.g., the following areas: acquisition and formal representation of user models; conceptual models and user stereotypes for personalization; student modeling and adaptive learning; models of groups of users; user model driven personalised information discovery and retrieval; recommender systems; adaptive user interfaces and agents; adaptation for accessibility and inclusion; generic user modeling systems and tools; interoperability of user models; personalization in areas such as; affective computing; ubiquitous and mobile computing; language based interactions; multi-modal interactions; virtual and augmented reality; social media and the Web; human-robot interaction; behaviour change interventions; personalized applications in specific domains; privacy, accountability, and security of information for personalization; responsible adaptation: fairness, accountability, explainability, transparency and control; methods for the design and evaluation of user models and adaptive systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信