Improving the Trustworthiness of Recommendations in Collaborative Filtering under the Belief Function Framework

Raoua Abdelkhalek
{"title":"Improving the Trustworthiness of Recommendations in Collaborative Filtering under the Belief Function Framework","authors":"Raoua Abdelkhalek","doi":"10.1145/3109859.3109864","DOIUrl":null,"url":null,"abstract":"Collaborative Filtering (CF) consists of filtering data, predicting users' preferences and providing recommendations accordingly. Commonly, neighborhood-based CF methods predict the future ratings based on similar users (user-based) or similar items (item-based) to perform recommendations. However, the reliability of the information provided by these pieces of evidence as well as the final predictions cannot be fully trusted. Incorporating trust in the recommendation process can be argued to be an important challenge in Recommender Systems (RSs). To tackle these issues, we propose new CF approaches under the belief function framework. The final prediction is obtained by fusing evidences from similar items or similar users using Dempster's rule of combination. The prediction process of our evidential approaches is able to provide the users with a global overview of their possible preferences. This would lead to increase their confidence towards the system as well as their satisfaction. In this paper, we mainly highlight the benefits of incorporating uncertainty in CF approaches using the belief function theory. We present the preliminary results and also discuss our ongoing works, as well as the challenges in the future.","PeriodicalId":417173,"journal":{"name":"Proceedings of the Eleventh ACM Conference on Recommender Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eleventh ACM Conference on Recommender Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3109859.3109864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Collaborative Filtering (CF) consists of filtering data, predicting users' preferences and providing recommendations accordingly. Commonly, neighborhood-based CF methods predict the future ratings based on similar users (user-based) or similar items (item-based) to perform recommendations. However, the reliability of the information provided by these pieces of evidence as well as the final predictions cannot be fully trusted. Incorporating trust in the recommendation process can be argued to be an important challenge in Recommender Systems (RSs). To tackle these issues, we propose new CF approaches under the belief function framework. The final prediction is obtained by fusing evidences from similar items or similar users using Dempster's rule of combination. The prediction process of our evidential approaches is able to provide the users with a global overview of their possible preferences. This would lead to increase their confidence towards the system as well as their satisfaction. In this paper, we mainly highlight the benefits of incorporating uncertainty in CF approaches using the belief function theory. We present the preliminary results and also discuss our ongoing works, as well as the challenges in the future.
在信念函数框架下提高协同过滤推荐可信度
协同过滤(CF)包括过滤数据、预测用户偏好并提供相应的推荐。通常,基于邻域的CF方法基于相似的用户(基于用户)或相似的项目(基于项目)预测未来的评级,以执行推荐。然而,这些证据提供的信息以及最终预测的可靠性不能完全信任。将信任整合到推荐过程中可以说是推荐系统(RSs)的一个重要挑战。为了解决这些问题,我们在信念函数框架下提出了新的CF方法。利用Dempster的组合规则将相似物品或相似用户的证据进行融合,得到最终的预测结果。我们的证据方法的预测过程能够为用户提供他们可能的偏好的全局概述。这将增加他们对制度的信心和满意度。在本文中,我们主要强调了使用信念函数理论将不确定性纳入CF方法的好处。我们介绍了初步的结果,并讨论了我们正在进行的工作,以及未来的挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信