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}
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.