Differential Privacy and Bayesian for Context-Aware Recommender Systems

Differential Privacy and Bayesian for Context-Aware Recommender Systems

Shuxin Yang, Kaili Zhu
DOI: 10.4018/IJCINI.20211001.oa2
Article PDF Download
Open access articles are freely available for download

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.
Article Preview
Top

So far, there are mostly three types of recommender systems: collaborative filtering(Herlocker et al., 2004), content-based recommendation(Linden et al., 2003), and hybrid recommendation(Burke & Reasoning, 2002). Collaborative filtering is the primary recommender system, which the main method is to calculate the similarity of users or items by rating score and then use the similarity to recommend items to users. The CARS is integrating the contextual information into the recommendation process that can make the higher accuracy of recommendation.

Generally, the contextual information includes time, location, weather, user information, etc. The accuracy of the recommendation can be improved if the contextual information is effectively applied to the recommender systems. CARS is a multidimensional user-item-context scoring utility model, which is the extension of traditional user-item two-dimensional rating utility model. Although recommendation systems can provide users with personalized content and recommendations, any recommendation system poses a potential privacy threat to their users because it aggregates user preference data. The user information collected by the recommendation system may be inadvertently leaked by the service provider, or the user information may be stolen due to a hacker attack on the server.

Unfortunately, the privacy risks and security problems have been ignored during the study of the recommendation system. People are also paying more and more attention to the security of privacy and they are not willing to disclose their own real information. Generally, data may get be hacked when it is published, stored, and converted. The k-anonymity(Sweeney, 2002) and l-diversity(Machanavajjhala et al., 2006) are the traditional privacy protection technologies. The principle of k-anonymity is to confuse the attribute values of the data to ensure that every record in an anonymous data set cannot be distinguished from k-1 records, but it is vulnerable to consistency attack. So as to resolve the shortcoming, l-diversity technology was put forward. Nevertheless, these privacy protection technologies can't resist attacks by the attackers with data background knowledge.

The following tables shows some patients’ information of a medical system. If Alice is Bob's neighbor, Bob's disease information is in the Table 1. As a neighbor who knows him better, it is easy to figure out Bob's personal Information. Even if she is not an attacker, it also causes the leakage of patient information.

Table 1.
Patients’ Information
No.NameAgeZipcodeDisease
1Alice46201612Heart disease
2Tom35201621Heart disease
3Bob44201612Cancer
4Mike67101620Cancer
5Eva56201615Pneumonia
6Jane39201612Pneumonia

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2024)
Volume 17: 1 Issue (2023)
Volume 16: 1 Issue (2022)
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing