A New Collaborative Filtering Algorithm with Combination of Explicit Trust and Implicit Trust

Huan Zhao, Yuansun Zhang, Yufeng Xiao
{"title":"A New Collaborative Filtering Algorithm with Combination of Explicit Trust and Implicit Trust","authors":"Huan Zhao, Yuansun Zhang, Yufeng Xiao","doi":"10.1109/ICCSE.2018.8468763","DOIUrl":null,"url":null,"abstract":"To alleviate data sparsity and cold start problems of conventional collaborative filtering, social trust information has been incorporated into recommender systems. There exist a few approaches, which mainly use the trust scores explicitly expressed by users and effectively improve accuracy of rating prediction. However, having users provide explicit trust scores of each other is often full of challenges. In this paper, we propose a novel method to incorporate both explicit and implicit trust in providing recommendations. First, we use one of Trust Metrics algorithms to compute and predict implicit trust scores between users based on their interactions. Then, we merge ratings of a user's explicitly and implicitly trusted neighbors to complement and represent the preferences of the user. Experimental results show that our method outperforms other counterparts both in terms of accuracy and coverage.","PeriodicalId":228760,"journal":{"name":"2018 13th International Conference on Computer Science & Education (ICCSE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 13th International Conference on Computer Science & Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2018.8468763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

To alleviate data sparsity and cold start problems of conventional collaborative filtering, social trust information has been incorporated into recommender systems. There exist a few approaches, which mainly use the trust scores explicitly expressed by users and effectively improve accuracy of rating prediction. However, having users provide explicit trust scores of each other is often full of challenges. In this paper, we propose a novel method to incorporate both explicit and implicit trust in providing recommendations. First, we use one of Trust Metrics algorithms to compute and predict implicit trust scores between users based on their interactions. Then, we merge ratings of a user's explicitly and implicitly trusted neighbors to complement and represent the preferences of the user. Experimental results show that our method outperforms other counterparts both in terms of accuracy and coverage.
一种新的显性信任与隐性信任相结合的协同过滤算法
为了缓解传统协同过滤的数据稀疏性和冷启动问题,将社会信任信息引入推荐系统。目前有几种方法,主要是利用用户明确表达的信任分数,有效地提高了评级预测的准确性。然而,让用户提供彼此明确的信任分数往往充满挑战。在本文中,我们提出了一种结合显式和隐式信任的新方法来提供推荐。首先,我们使用一种信任度量算法来计算和预测用户之间基于交互的隐含信任分数。然后,我们合并用户显式和隐式信任邻居的评级,以补充和表示用户的偏好。实验结果表明,我们的方法在准确率和覆盖范围上都优于其他同类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信