arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.5600cs.DS
收藏

个性化社会推荐中效用和隐私保护的可能性

On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations

Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma

摘要:

随着最近像Facebook这样的社交网络的兴起,新形式的推荐已经成为可能--个性化的广告推荐、内容推荐,甚至是基于一个人的社交互动的新的社交和产品联系。在本文中,我们研究是否“社会建议”,或建议,利用用户的社交网络,可以不披露用户之间的敏感链接。更准确地说,我们量化的效用损失时,现有的推荐算法进行修改,以满足一个强有力的隐私概念称为差分隐私。我们提出的最小损失的效用的任何推荐算法,是不同的私人的下限。我们还提出了两个推荐算法,满足差分隐私,分析其性能的下限相比,分析和实验,并表明,良好的私人社交推荐是可行的,只有少数用户在社交网络或宽松的隐私参数设置。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑