Please use this identifier to cite or link to this item:
|Title:||On the privacy and utility of anonymized social networks|
|Keywords:||H.2.8 [Database Management]: Database Applications-Data mining|
|Source:||Song, Y.,Nobari, S.,Lu, X.,Karras, P.,Bressan, S. (2011). On the privacy and utility of anonymized social networks. ACM International Conference Proceeding Series : 246-253. ScholarBank@NUS Repository. https://doi.org/10.1145/2095536.2095578|
|Abstract:||You are on Facebook or you are out. Of course, this assessment is controversial and its rationale arguable. It is nevertheless not far, for many of us, from the reason behind our joining social media and publishing and sharing details of our professional and private lives. Not only the personal details we may reveal but also the very structure of the networks themselves are sources of invaluable information for any organization wanting to understand and learn about social groups, their dynamics and their members. These organizations may or may not be benevolent. It is therefore important to devise, design and evaluate solutions that guarantee some privacy. One approach that attempts to reconcile the different stakeholders' requirement is the publication of a modified graph. The perturbation is hoped to be sufficient to protect members' privacy while it maintains sufficient utility for analysts wanting to study the social media as a whole. It is necessarily a compromise. In this paper we try and empirically quantify the inevitable trade-off between utility and privacy. We do so for one state-of-the-art graph anonymization algorithm that protects against most structural attacks, the k-automorphism algorithm. We measure several metrics for a series of real graphs from various social media before and after their anonymization under various settings. © 2011 ACM.|
|Source Title:||ACM International Conference Proceeding Series|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 29, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.