Utility-oriented K-anonymization on social networks

13Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

"Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in nontrivial utility loss. The reason is that the number of the edges modified when anonymizing the social network is the only metric to evaluate utility loss, not considering the fact that different edge modifications have different impact on the network structure. To tackle this issue, we propose a novel utility-oriented social network anonymization scheme to achieve privacy protection with relatively low utility loss. First, a proper utility evaluation model is proposed. It focuses on the changes on social network topological feature, but not purely the number of edge modifications. Second, an efficient algorithm is designed to anonymize a given social network with relatively low utility loss. Experimental evaluation shows that our approach effectively generates anonymized social network with high utility. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Wang, Y., Xie, L., Zheng, B., & Lee, K. C. K. (2011). Utility-oriented K-anonymization on social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6587 LNCS, pp. 78–92). https://doi.org/10.1007/978-3-642-20149-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free