Popularity Bias in Collaborative Filtering-Based Multimedia Recommender Systems

Dominik Kowald, Emanuel Lacić
{"title":"Popularity Bias in Collaborative Filtering-Based Multimedia Recommender Systems","authors":"Dominik Kowald, Emanuel Lacić","doi":"10.48550/arXiv.2203.00376","DOIUrl":null,"url":null,"abstract":"Multimedia recommender systems suggest media items, e.g., songs, (digital) books and movies, to users by utilizing concepts of traditional recommender systems such as collaborative filtering. In this paper, we investigate a potential issue of such collaborative-filtering based multimedia recommender systems, namely popularity bias that leads to the underrepresentation of unpopular items in the recommendation lists. Therefore, we study four multimedia datasets, i.e., LastFm, MovieLens, BookCrossing and MyAnimeList, that we each split into three user groups differing in their inclination to popularity, i.e., LowPop, MedPop and HighPop. Using these user groups, we evaluate four collaborative filtering-based algorithms with respect to popularity bias on the item and the user level. Our findings are three-fold: firstly, we show that users with little interest into popular items tend to have large user profiles and thus, are important data sources for multimedia recommender systems. Secondly, we find that popular items are recommended more frequently than unpopular ones. Thirdly, we find that users with little interest into popular items receive significantly worse recommendations than users with medium or high interest into popularity.","PeriodicalId":165601,"journal":{"name":"International Workshop on Algorithmic Bias in Search and Recommendation","volume":"264 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Algorithmic Bias in Search and Recommendation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2203.00376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Multimedia recommender systems suggest media items, e.g., songs, (digital) books and movies, to users by utilizing concepts of traditional recommender systems such as collaborative filtering. In this paper, we investigate a potential issue of such collaborative-filtering based multimedia recommender systems, namely popularity bias that leads to the underrepresentation of unpopular items in the recommendation lists. Therefore, we study four multimedia datasets, i.e., LastFm, MovieLens, BookCrossing and MyAnimeList, that we each split into three user groups differing in their inclination to popularity, i.e., LowPop, MedPop and HighPop. Using these user groups, we evaluate four collaborative filtering-based algorithms with respect to popularity bias on the item and the user level. Our findings are three-fold: firstly, we show that users with little interest into popular items tend to have large user profiles and thus, are important data sources for multimedia recommender systems. Secondly, we find that popular items are recommended more frequently than unpopular ones. Thirdly, we find that users with little interest into popular items receive significantly worse recommendations than users with medium or high interest into popularity.
基于协同过滤的多媒体推荐系统中的流行偏差
多媒体推荐系统利用协同过滤等传统推荐系统的概念向用户推荐媒体项目,例如歌曲、(数字)书籍和电影。在本文中,我们研究了这种基于协同过滤的多媒体推荐系统的一个潜在问题,即流行度偏差,它导致推荐列表中不受欢迎的项目代表性不足。因此,我们研究了四个多媒体数据集,即LastFm, MovieLens, BookCrossing和MyAnimeList,我们将每个数据集分为三个用户组,即低流行,MedPop和高流行。使用这些用户组,我们评估了四种基于协同过滤的算法,这些算法考虑了项目和用户级别的流行度偏差。我们的发现有三个方面:首先,我们表明,对流行商品不感兴趣的用户往往拥有庞大的用户档案,因此,是多媒体推荐系统的重要数据源。其次,我们发现受欢迎的项目比不受欢迎的项目被推荐的频率更高。第三,我们发现对热门产品不感兴趣的用户得到的推荐明显差于对热门产品有中等或高度兴趣的用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信