Using Implicit Feedback for Neighbors Selection: Alleviating the Sparsity Problem in Collaborative Recommendation Systems

Bruno Bandeira Fernandes, Juarez A. P. Sacenti, Roberto Willrich
{"title":"Using Implicit Feedback for Neighbors Selection: Alleviating the Sparsity Problem in Collaborative Recommendation Systems","authors":"Bruno Bandeira Fernandes, Juarez A. P. Sacenti, Roberto Willrich","doi":"10.1145/3126858.3126896","DOIUrl":null,"url":null,"abstract":"The most popular Recommender systems (RSs) employ Collaborative Filtering (CF) algorithms where users explicitly rate items. Based on these ratings, a user-item rating matrix is generated and used to select the items to be recommended for a target user. An important step in this process is to determine the neighborhood of a target user, i.e. a set of users who rate items similarly to this user. One of the limitations of CF is precisely the need of rating data provided voluntarily by users. The lack of interest of users to provide this kind of information increases the sparsity problem of the ratings matrix. In this paper, we propose the use of implicit feedback for neighbors selection to alleviate the sparsity problem in CF-based RSs. In this proposal, user profiles are built based on the characteristics of items that have been accessed or purchased, and not necessarily rated by the users. This user profile is used exclusively to the neighborhoods formation, which considers not how they have rated items, but by the characteristics of the items that they have accessed or purchased. Our technique was implemented with Apache Mahout Framework and evaluated across experiments in the domain of movies by using a dataset from Movielens project. The results demonstrated that our technique produces better quality recommendations when compared to the classic CF mainly in presence of sparsity of rating data.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3126858.3126896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The most popular Recommender systems (RSs) employ Collaborative Filtering (CF) algorithms where users explicitly rate items. Based on these ratings, a user-item rating matrix is generated and used to select the items to be recommended for a target user. An important step in this process is to determine the neighborhood of a target user, i.e. a set of users who rate items similarly to this user. One of the limitations of CF is precisely the need of rating data provided voluntarily by users. The lack of interest of users to provide this kind of information increases the sparsity problem of the ratings matrix. In this paper, we propose the use of implicit feedback for neighbors selection to alleviate the sparsity problem in CF-based RSs. In this proposal, user profiles are built based on the characteristics of items that have been accessed or purchased, and not necessarily rated by the users. This user profile is used exclusively to the neighborhoods formation, which considers not how they have rated items, but by the characteristics of the items that they have accessed or purchased. Our technique was implemented with Apache Mahout Framework and evaluated across experiments in the domain of movies by using a dataset from Movielens project. The results demonstrated that our technique produces better quality recommendations when compared to the classic CF mainly in presence of sparsity of rating data.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用隐式反馈进行邻居选择:缓解协同推荐系统中的稀疏性问题
最流行的推荐系统(RSs)采用协同过滤(CF)算法,用户明确地对项目进行评级。基于这些评分,生成一个用户-物品评分矩阵,并用于为目标用户选择要推荐的物品。这个过程中的一个重要步骤是确定目标用户的邻居,即一组与该用户评价相似的用户。CF的局限性之一就是需要用户自愿提供评分数据。用户对提供这类信息缺乏兴趣增加了评级矩阵的稀疏性问题。在本文中,我们提出使用隐式反馈来选择邻居,以缓解基于cf的RSs的稀疏性问题。在这个建议中,用户配置文件是基于已经访问或购买的物品的特征构建的,而不一定是由用户评价的。此用户配置文件仅用于社区形成,它不考虑他们如何对物品进行评级,而是考虑他们访问或购买的物品的特征。我们的技术是用Apache Mahout框架实现的,并通过使用来自Movielens项目的数据集在电影领域的实验中进行评估。结果表明,与经典的CF相比,我们的技术产生了更好的质量推荐,主要是由于评级数据的稀疏性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
STorM: A Hypermedia Authoring Model for Interactive Digital Out-of-Home Media Distributed Data Clustering in the Context of the Internet of Things: A Data Traffic Reduction Approach AnyLanguage-To-LIBRAS: Evaluation of an Machine Translation Service of Any Oralized Language for the Brazilian Sign Language Adaptive Sensing Relevance Exploiting Social Media Mining in Smart Cities Automatic Text Recognition in Web Images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1