Are All Rejected Recommendations Equally Bad?: Towards Analysing Rejected Recommendations

Shir Frumerman, Guy Shani, Bracha Shapira, Oren Sar Shalom
{"title":"Are All Rejected Recommendations Equally Bad?: Towards Analysing Rejected Recommendations","authors":"Shir Frumerman, Guy Shani, Bracha Shapira, Oren Sar Shalom","doi":"10.1145/3320435.3320448","DOIUrl":null,"url":null,"abstract":"When evaluating algorithms that recommend a list of relevant items to a user, it is common to use metrics such as precision to measure the system accuracy. When computing precision, one computes the number of items that were selected by the user among the recommended items. As such, recommended items that were not selected by the user, which we call \\em rejected recommendations, are all considered to be bad recommendations, resulting in no increase to the system accuracy metric. Our ultimate goal is to develop a new recommendation accuracy evaluation metric, which may assign some value to the rejected recommendations. In this paper, as a first step, we claim that some rejected recommendations are better than others. Specifically, we consider items that are similar to the item that was finally selected, as better recommendations than items that bear little similarity. We conduct a user study, showing that rejected recommendations that have high content or collaborative similarity to the selected item are perceived by users as better recommendations than items with low similarity. In addition, we study the correlations between the recommended items shown to a user and the un-recommended items that the user has selected in a real-life job posting dataset. We show that when considering item similarity rather than simple precision, the correlations are much higher. This may be attributed to the influence of the recommended items on the decisions of the user.","PeriodicalId":254537,"journal":{"name":"Proceedings of the 27th ACM Conference on User Modeling, Adaptation and Personalization","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 27th ACM Conference on User Modeling, Adaptation and Personalization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3320435.3320448","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

When evaluating algorithms that recommend a list of relevant items to a user, it is common to use metrics such as precision to measure the system accuracy. When computing precision, one computes the number of items that were selected by the user among the recommended items. As such, recommended items that were not selected by the user, which we call \em rejected recommendations, are all considered to be bad recommendations, resulting in no increase to the system accuracy metric. Our ultimate goal is to develop a new recommendation accuracy evaluation metric, which may assign some value to the rejected recommendations. In this paper, as a first step, we claim that some rejected recommendations are better than others. Specifically, we consider items that are similar to the item that was finally selected, as better recommendations than items that bear little similarity. We conduct a user study, showing that rejected recommendations that have high content or collaborative similarity to the selected item are perceived by users as better recommendations than items with low similarity. In addition, we study the correlations between the recommended items shown to a user and the un-recommended items that the user has selected in a real-life job posting dataset. We show that when considering item similarity rather than simple precision, the correlations are much higher. This may be attributed to the influence of the recommended items on the decisions of the user.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
所有被拒绝的推荐都一样糟糕吗?:分析被拒绝的建议
在评估向用户推荐相关项目列表的算法时,通常使用诸如精度之类的度量来度量系统的准确性。当计算精度时,计算用户在推荐项目中选择的项目数量。因此,没有被用户选择的推荐项目,我们称之为拒绝的推荐,都被认为是糟糕的推荐,导致系统精度指标没有增加。我们的最终目标是开发一个新的推荐准确性评估指标,它可以为被拒绝的推荐分配一些值。在本文中,作为第一步,我们声称一些被拒绝的建议比其他的更好。具体来说,我们认为与最终选择的项目相似的项目比相似度低的项目更好。我们进行了一项用户研究,结果表明,与所选项目具有高内容相似性或协同相似性的被拒绝的推荐被用户认为是比低相似性的项目更好的推荐。此外,我们还研究了用户在现实生活中的职位发布数据集中选择的推荐项目与用户选择的不推荐项目之间的相关性。我们表明,当考虑项目相似性而不是简单的精度时,相关性要高得多。这可能归因于推荐项目对用户决策的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Modelling of Attentiveness to Messaging: A Hybrid Approach Engagement, Metrics and Personalisation: the Good, the Bad and the Ugly Towards Social Choice-based Explanations in Group Recommender Systems Personalized Gait-based Authentication Using UWB Wearable Devices Towards Utter Well-Being: Personalization for Guardian Angels
×
引用
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