{"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}
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.