上下文感知推荐系统的差分隐私和贝叶斯

Pub Date : 2021-10-01 DOI:10.4018/ijcini.20211001.oa2
Shuxing Yang, Kaili Zhu
{"title":"上下文感知推荐系统的差分隐私和贝叶斯","authors":"Shuxing Yang, Kaili Zhu","doi":"10.4018/ijcini.20211001.oa2","DOIUrl":null,"url":null,"abstract":"Incorporate contextual information into recommendation systems can obtain better accuracy of recommendation, however, the users’ individual privacy may be disclosed by attackers. In order to resolve this problem, the authors propose a context-aware recommendation system that integrates Differential Privacy and Bayesian Network technologies (DPBCF). Firstly, the paper uses k-means algorithm to cluster items to relieve sparsity of rating matrix. Next, for the sake of protecting users’ privacy, the paper adds Laplace noises to ratings. And then adopts Bayesian Network technology to calculate the probability that users like a type of item with contextual information. At last, the authors illustrate the experimental evaluations to show that the proposed algorithm can provide a stronger privacy protection while improving the accuracy of recommendations.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Differential Privacy and Bayesian for Context-Aware Recommender Systems\",\"authors\":\"Shuxing Yang, Kaili Zhu\",\"doi\":\"10.4018/ijcini.20211001.oa2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Incorporate contextual information into recommendation systems can obtain better accuracy of recommendation, however, the users’ individual privacy may be disclosed by attackers. In order to resolve this problem, the authors propose a context-aware recommendation system that integrates Differential Privacy and Bayesian Network technologies (DPBCF). Firstly, the paper uses k-means algorithm to cluster items to relieve sparsity of rating matrix. Next, for the sake of protecting users’ privacy, the paper adds Laplace noises to ratings. And then adopts Bayesian Network technology to calculate the probability that users like a type of item with contextual information. At last, the authors illustrate the experimental evaluations to show that the proposed algorithm can provide a stronger privacy protection while improving the accuracy of recommendations.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/ijcini.20211001.oa2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijcini.20211001.oa2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

将上下文信息整合到推荐系统中可以获得更好的推荐准确性,但用户的个人隐私可能会被攻击者泄露。为了解决这一问题,作者提出了一种融合差分隐私和贝叶斯网络技术(DPBCF)的上下文感知推荐系统。首先,采用k-means算法对项目进行聚类,缓解评级矩阵的稀疏性;其次,为了保护用户的隐私,本文在评分中加入了拉普拉斯噪声。然后采用贝叶斯网络技术计算用户喜欢某一类带有上下文信息的商品的概率。最后,通过实验验证表明,该算法在提高推荐准确率的同时,能够提供更强的隐私保护。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
Differential Privacy and Bayesian for Context-Aware Recommender Systems
Incorporate contextual information into recommendation systems can obtain better accuracy of recommendation, however, the users’ individual privacy may be disclosed by attackers. In order to resolve this problem, the authors propose a context-aware recommendation system that integrates Differential Privacy and Bayesian Network technologies (DPBCF). Firstly, the paper uses k-means algorithm to cluster items to relieve sparsity of rating matrix. Next, for the sake of protecting users’ privacy, the paper adds Laplace noises to ratings. And then adopts Bayesian Network technology to calculate the probability that users like a type of item with contextual information. At last, the authors illustrate the experimental evaluations to show that the proposed algorithm can provide a stronger privacy protection while improving the accuracy of recommendations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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