K-anonymisation of social network by vertex and edge modification Online publication date: Tue, 26-Apr-2016
by Yuliang Zhang; Tinghuai Ma; Jie Cao; Meili Tang
International Journal of Embedded Systems (IJES), Vol. 8, No. 2/3, 2016
Abstract: With the rapid growth of social networks, a large quantity of social network data is being collected, and published for analysis. Privacy is one of the major issues when publishing social network data. To address the issue, several social network anonymisation approaches have been proposed. However, these methods usually introduce a large amount of distortion to the original social network graph, thus, the utility of the social network is not preserved very well. In this paper, we present a two-phase approach: in the first phase, we get the target degree of each vertex; the community structure of the social network and path length between vertices are considered when finding candidates to increase the degree of vertex to its target degree in the second phase. Experimental results on real world datasets show that the utility of the social network is well preserved with our approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com