Achieving Optimal Privacy in Trust-Aware Social Recommender Systems


Dokoohaki N., KALELİ C., Polat H., Matskin M.

2nd International Conference on Social Informatics, Laxenburg, Austria, 27 - 29 October 2010, vol.6430, pp.62-65 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 6430
  • Doi Number: 10.1007/978-3-642-16567-2_5
  • City: Laxenburg
  • Country: Austria
  • Page Numbers: pp.62-65
  • Keywords: Privacy, Trust, Optimization, Data Disguising, Social networks, Collaborative filtering, Recommender systems
  • Anadolu University Affiliated: Yes

Abstract

Collaborative filtering (CF) recommenders are subject to numerous shortcomings such as centralized processing, vulnerability to shilling attacks, and most important of all privacy. To overcome these obstacles, researchers proposed for utilization of interpersonal trust between users, to alleviate many of these crucial shortcomings. Till now, attention has been mainly paid to strong points about trust-aware recommenders such as alleviating profile sparsity or calculation cost efficiency, while least attention has been paid on investigating the notion of privacy surrounding the disclosure of individual ratings and most importantly protection of trust computation across social networks forming the backbone of these systems. To contribute to addressing problem of privacy in trust-aware recommenders, within this paper, first we introduce a framework for enabling privacy-preserving trust-aware recommendation generation. While trust mechanism aims at elevating recommenders accuracy, to preserve privacy, accuracy of the system needs to be decreased. Since within this context, privacy and accuracy are conflicting goals we show that a Pareto set can be found as an optimal setting for both privacy-preserving and trust-enabling mechanisms. We show that this Pareto set, when used as the configuration for measuring the accuracy of base collaborative filtering engine, yields an optimized tradeoff between conflicting goals of privacy and accuracy. We prove this concept along with applicability of our framework by experimenting with accuracy and privacy factors, and we show through experiment how such optimal set can be inferred.