By Topic

The Maximum Greedy Algorithm on Privacy Protection Based on Social Network

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

2 Author(s)
Ai Jumei ; Key Lab. of Radioactive Geol. & Exploration Technol. Fundamental Sci. for Nat. Defense, East China Inst. of Technol., Fuzhou, China ; Mao Shuhua

The flow of information in the network currently existing attacks and malicious damage, a privacy protection algorithm based on the maximum greedy is proposed, the data privacy acts as weights between nodes in network diagram , change these weights to achieve the protection of important data, by obtaining the shortest path way to ensure that efficiency is not influenced ,the experimental results show that this algorithm not only protects data privacy but also efficiently ensures the effectiveness of data.

Published in:

E-Product E-Service and E-Entertainment (ICEEE), 2010 International Conference on

Date of Conference:

7-9 Nov. 2010