增强了音乐推荐系统的相似性

Vasileios Gavriilidis, A. Tefas, Constantine Kotropoulos, N. Nikolaidis
{"title":"增强了音乐推荐系统的相似性","authors":"Vasileios Gavriilidis, A. Tefas, Constantine Kotropoulos, N. Nikolaidis","doi":"10.1109/DMIAF.2016.7574913","DOIUrl":null,"url":null,"abstract":"Music is an essential part of human life. It is a way to express ourselves. Its importance gave rise to music Recommender Systems (RS) through e-commerce applications. The most commonly used technique in such applications is Collaborative Filtering (CF) that uses the User-Item (UI) matrix. The latter codes the users' preferences for items. The advantage of using CF methods is their simplicity and their relatively high efficiency. However, data sparsity deteriorates their efficiency. In this paper, we propose a process that can enhance the similarities among users in a way that can address the sparsity problem. The proposed user based CF algorithm alters the values of similarity matrix between users by incorporating a graph based method, improving the performance of the RS. We also propose a method that groups users using spectral clustering and together with the graph-based similarity method yield even more accurate predictions. Experiments have been conducted on a music dataset, highlighting the superiority of the proposed method against typical user-based CF.","PeriodicalId":404025,"journal":{"name":"2016 Digital Media Industry & Academic Forum (DMIAF)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Enhanced similarities for a music Recommender System\",\"authors\":\"Vasileios Gavriilidis, A. Tefas, Constantine Kotropoulos, N. Nikolaidis\",\"doi\":\"10.1109/DMIAF.2016.7574913\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Music is an essential part of human life. It is a way to express ourselves. Its importance gave rise to music Recommender Systems (RS) through e-commerce applications. The most commonly used technique in such applications is Collaborative Filtering (CF) that uses the User-Item (UI) matrix. The latter codes the users' preferences for items. The advantage of using CF methods is their simplicity and their relatively high efficiency. However, data sparsity deteriorates their efficiency. In this paper, we propose a process that can enhance the similarities among users in a way that can address the sparsity problem. The proposed user based CF algorithm alters the values of similarity matrix between users by incorporating a graph based method, improving the performance of the RS. We also propose a method that groups users using spectral clustering and together with the graph-based similarity method yield even more accurate predictions. Experiments have been conducted on a music dataset, highlighting the superiority of the proposed method against typical user-based CF.\",\"PeriodicalId\":404025,\"journal\":{\"name\":\"2016 Digital Media Industry & Academic Forum (DMIAF)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Digital Media Industry & Academic Forum (DMIAF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMIAF.2016.7574913\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Digital Media Industry & Academic Forum (DMIAF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMIAF.2016.7574913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

音乐是人类生活中不可缺少的一部分。这是一种表达自己的方式。它的重要性促使电子商务应用程序产生了音乐推荐系统(RS)。这类应用程序中最常用的技术是协同过滤(CF),它使用用户项(UI)矩阵。后者编码用户对物品的偏好。使用CF方法的优点是其简单性和相对较高的效率。然而,数据稀疏性降低了它们的效率。在本文中,我们提出了一个过程,该过程可以通过解决稀疏性问题的方式增强用户之间的相似性。本文提出的基于用户的CF算法通过结合基于图的方法来改变用户之间的相似矩阵值,从而提高了RS的性能。我们还提出了一种使用谱聚类对用户进行分组的方法,并与基于图的相似度方法一起产生更准确的预测。在一个音乐数据集上进行了实验,突出了所提出的方法相对于典型的基于用户的CF的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhanced similarities for a music Recommender System
Music is an essential part of human life. It is a way to express ourselves. Its importance gave rise to music Recommender Systems (RS) through e-commerce applications. The most commonly used technique in such applications is Collaborative Filtering (CF) that uses the User-Item (UI) matrix. The latter codes the users' preferences for items. The advantage of using CF methods is their simplicity and their relatively high efficiency. However, data sparsity deteriorates their efficiency. In this paper, we propose a process that can enhance the similarities among users in a way that can address the sparsity problem. The proposed user based CF algorithm alters the values of similarity matrix between users by incorporating a graph based method, improving the performance of the RS. We also propose a method that groups users using spectral clustering and together with the graph-based similarity method yield even more accurate predictions. Experiments have been conducted on a music dataset, highlighting the superiority of the proposed method against typical user-based CF.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信