流行基于信任的推荐系统

Stefan Magureanu, Nima Dokoohaki, Shahab Mokarizadeh, M. Matskin
{"title":"流行基于信任的推荐系统","authors":"Stefan Magureanu, Nima Dokoohaki, Shahab Mokarizadeh, M. Matskin","doi":"10.1109/SocialCom-PASSAT.2012.94","DOIUrl":null,"url":null,"abstract":"Collaborative filtering(CF) recommender systems are among the most popular approaches to solving the information overload problem in social networks by generating accurate predictions based on the ratings of similar users. Traditional CF recommenders suffer from lack of scalability while decentralized CF recommenders (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in this paper we propose a decentralized approach to CF recommender systems that uses the T-Man algorithm to create and maintain an overlay network that in turn would facilitate the generation of recommendations based on local information of a node. We analyse the influence of the number of rounds and neighbors on the accuracy of prediction and item coverage and we propose a new approach to inferring trust values between a user and its neighbors. Our experiment son two datasets show an improvement of prediction accuracy relative to previous approaches while using a highly scalable, decentralized paradigm. We also analyse item coverage and show that our system is able to generate predictions for significant fraction of the users, which is comparable with the centralized approaches.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"62 25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Epidemic Trust-Based Recommender Systems\",\"authors\":\"Stefan Magureanu, Nima Dokoohaki, Shahab Mokarizadeh, M. Matskin\",\"doi\":\"10.1109/SocialCom-PASSAT.2012.94\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering(CF) recommender systems are among the most popular approaches to solving the information overload problem in social networks by generating accurate predictions based on the ratings of similar users. Traditional CF recommenders suffer from lack of scalability while decentralized CF recommenders (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in this paper we propose a decentralized approach to CF recommender systems that uses the T-Man algorithm to create and maintain an overlay network that in turn would facilitate the generation of recommendations based on local information of a node. We analyse the influence of the number of rounds and neighbors on the accuracy of prediction and item coverage and we propose a new approach to inferring trust values between a user and its neighbors. Our experiment son two datasets show an improvement of prediction accuracy relative to previous approaches while using a highly scalable, decentralized paradigm. We also analyse item coverage and show that our system is able to generate predictions for significant fraction of the users, which is comparable with the centralized approaches.\",\"PeriodicalId\":129526,\"journal\":{\"name\":\"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing\",\"volume\":\"62 25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SocialCom-PASSAT.2012.94\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SocialCom-PASSAT.2012.94","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

协同过滤(CF)推荐系统是解决社交网络中信息过载问题的最流行的方法之一,它基于相似用户的评分生成准确的预测。传统的CF推荐器缺乏可扩展性,而去中心化的CF推荐器(基于dht、基于gossip等)有望缓解这一问题。因此,在本文中,我们提出了一种去中心化的CF推荐系统方法,该方法使用T-Man算法来创建和维护一个覆盖网络,从而促进基于节点的本地信息生成推荐。我们分析了回合数和邻居数对预测精度和项目覆盖率的影响,并提出了一种推断用户与其邻居之间信任值的新方法。我们在两个数据集上的实验表明,在使用高度可扩展的分散范式时,相对于以前的方法,预测精度有所提高。我们还分析了项目覆盖率,并表明我们的系统能够为很大一部分用户生成预测,这与集中式方法相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Epidemic Trust-Based Recommender Systems
Collaborative filtering(CF) recommender systems are among the most popular approaches to solving the information overload problem in social networks by generating accurate predictions based on the ratings of similar users. Traditional CF recommenders suffer from lack of scalability while decentralized CF recommenders (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in this paper we propose a decentralized approach to CF recommender systems that uses the T-Man algorithm to create and maintain an overlay network that in turn would facilitate the generation of recommendations based on local information of a node. We analyse the influence of the number of rounds and neighbors on the accuracy of prediction and item coverage and we propose a new approach to inferring trust values between a user and its neighbors. Our experiment son two datasets show an improvement of prediction accuracy relative to previous approaches while using a highly scalable, decentralized paradigm. We also analyse item coverage and show that our system is able to generate predictions for significant fraction of the users, which is comparable with the centralized approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信