By Topic

Anonymizing Social Network Using Bipartite Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lihui Lan ; Comput. Sci. Sch., JiangSu Univ., Zhenjiang, China ; Shiguang Ju ; Hua Jin

Social networks applications have become popular for sharing information. Social networks data usually contain users'private information. So privacy preservation technologies should be exercised to protect social networks against various privacy leakages and attacks. In this paper, we give an approach for anonymizing social networks which can be represented as bipartite graphs. We propose automorphism publication to protect against multiple structural attacks and develop a BKM algorithm. We perform experiments on bipartite graph data to study the utility and information loss measure.

Published in:

Computational and Information Sciences (ICCIS), 2010 International Conference on

Date of Conference:

17-19 Dec. 2010