Privacy Preserving Recommendation System Based on Groups

Recommendation systems have received considerable attention in the recent decades. Yet with the development of information technology and social media, the risk in revealing private data to service providers has been a growing concern to more and more users. Trade-offs between quality and privacy in recommendation systems naturally arise. In this paper, we present a privacy preserving recommendation framework based on groups. The main idea is to use groups as a natural middleware to preserve users’ privacy. A distributed preference exchange algorithm is proposed to ensure the anonymity of data, wherein the effective size of the anonymity set asymptotically approaches the group size with time. We construct a hybrid collaborative filtering model based on Markov random walks to provide recommendations and predictions to group members. Experimental results on the MovieLens and Epinions datasets show that our proposed methods outperform the baseline methods, L+ and ItemRank, two state-of-the-art personalized recommendation algorithms, for both recommendation precision and hit rate despite the absence of personal preference information.

[1]  Zoran Obradovic,et al.  Collaborative Filtering Using a Regression-Based Approach , 2003, Knowledge and Information Systems.

[2]  Peter Eades A FAST EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM , 1993 .

[3]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[4]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[5]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[6]  H. Young,et al.  A Consistent Extension of Condorcet’s Election Principle , 1978 .

[7]  Ashwin Machanavajjhala,et al.  Personalized Social Recommendations - Accurate or Private? , 2011, Proc. VLDB Endow..

[8]  Claire Mathieu,et al.  Electronic Colloquium on Computational Complexity, Report No. 144 (2006) How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments , 2006 .

[9]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[10]  Michael Kaminsky,et al.  SybilGuard: Defending Against Sybil Attacks via Social Networks , 2008, IEEE/ACM Transactions on Networking.

[11]  Marco Gori,et al.  ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines , 2007, IJCAI.

[12]  Gianluca Stringhini,et al.  Detecting spammers on social networks , 2010, ACSAC '10.

[13]  Youssef Saab,et al.  A Fast and Effective Algorithm for the Feedback Arc Set Problem , 2001, J. Heuristics.

[14]  Sanjeev R. Kulkarni,et al.  A randomwalk based model incorporating social information for recommendations , 2012, 2012 IEEE International Workshop on Machine Learning for Signal Processing.

[15]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[16]  M. Kendall A NEW MEASURE OF RANK CORRELATION , 1938 .

[17]  Xuemin Lin,et al.  A Fast and Effective Heuristic for the Feedback Arc Set Problem , 1993, Inf. Process. Lett..

[18]  P. Massa,et al.  Trust-aware Bootstrapping of Recommender Systems , 2006 .

[19]  Wesley W. Chu,et al.  A social network-based recommender system , 2010 .

[20]  George Danezis,et al.  Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.

[21]  Ilya Mironov,et al.  Differentially private recommender systems: building privacy into the net , 2009, KDD.

[22]  John F. Canny,et al.  Collaborative filtering with privacy , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.

[23]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[24]  Andreas Pfitzmann,et al.  Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[25]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[26]  Nir Ailon,et al.  Aggregation of Partial Rankings, p-Ratings and Top-m Lists , 2007, SODA '07.

[27]  Taghi M. Khoshgoftaar,et al.  A Survey of Collaborative Filtering Techniques , 2009, Adv. Artif. Intell..

[28]  Martin Vetterli,et al.  Interval consensus: From quantized gossip to voting , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[29]  Lars Schmidt-Thieme,et al.  Tag-aware recommender systems by fusion of collaborative filtering algorithms , 2008, SAC '08.

[30]  Gilles Brassard,et al.  Alambic: a privacy-preserving recommender system for electronic commerce , 2008, International Journal of Information Security.

[31]  Wesley W. Chu,et al.  A Social Network-Based Recommender System (SNRS) , 2010, Data Mining for Social Network Data.

[32]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[33]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[34]  Animesh Nandi,et al.  P3: A Privacy Preserving Personalization Middleware for recommendation-based services , 2011 .

[35]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.