Computer Science – Data Structures and Algorithms
Scientific paper
2010-04-30
Computer Science
Data Structures and Algorithms
Scientific paper
With the recent surge of social networks like Facebook, new forms of recommendations have become possible -- personalized recommendations of ads, content, and even new social and product connections based on one's social interactions. In this paper, we study whether "social recommendations", or recommendations that utilize a user's social network, can be made without disclosing sensitive links between users. More precisely, we quantify the loss in utility when existing recommendation algorithms are modified to satisfy a strong notion of privacy called differential privacy. We propose lower bounds on the minimum loss in utility for any recommendation algorithm that is differentially private. We also propose two recommendation algorithms that satisfy differential privacy, analyze their performance in comparison to the lower bound, both analytically and experimentally, and show that good private social recommendations are feasible only for a few users in the social network or for a lenient setting of privacy parameters.
Korolova Aleksandra
Machanavajjhala Ashwin
Sarma Atish Das
No associations
LandOfFree
On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-388808