NDLI: $$\varvec{\textit{KDVEM}}$$ : a $$k$$ -degree anonymity with vertex and edge modification algorithm

Content Provider	Springer Nature Link
Author	Zhang, Yuliang Cao, Jie Shen, Jian Tian, Yuan Al Rodhaan, Mznah Ma, Tinghuai Tang, Meili Al Dhelaan, Abdullah
Copyright Year	2015
Abstract	Privacy is one of the most important issues in social social network data sharing. Structure anonymization is a effective method to protect user from being reidentfied through graph modifications. The data utility of the distorted graph structure after the anonymization is a really severe problem. Reducing the utility loss is a new measurement while k-anonymity as a criterion to guarantee privacy protection. The existing anonymization algorithms that use vertex’s degree modification usually introduce a large amount of distortion to the original social network graph. In this paper, we present a $$k$$ -degree anonymity with vertex and edge modification algorithm which includes two phase: first, finding the optimal target degree of each vertex; second, deciding the candidates to increase the vertex degree and adding the edges between vertices to satisfy the requirement. The community structure factors of the social network and the path length between vertices are used to evaluated the anonymization methods. Experimental results on real world datasets show that the average relative performance between anonymized data and original data is the best with our approach.
Ending Page	1184
Page Count	20
Starting Page	1165
File Format	PDF
ISSN	0010485X
e-ISSN	14365057
Journal	Computing
Issue Number	12
Volume Number	97
Language	English
Publisher	Springer Vienna
Publisher Date	2015-04-24
Publisher Place	Vienna
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Vertex Modification Software Engineering Computer Application in Administrative Data Processing Computer Science Artificial Intelligence (incl. Robotics) $$k$$ -Anonymity Social network Social networks Information Systems Applications (incl. Internet) Edge Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computational Mathematics Numerical Analysis Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Internet visualization

Sustainable mobile computing

From Methods to Images

Special issue on NETYS selected papers

Advances in mobile web information systems

Feature Point Tracking for Incomplete Trajectories

Adaptive Predictor for Lossless Image Compression

Semidefinite Programs and Association Schemes

Dynamic Programming Revisited: Improving Knapsack Algorithms

$$\varvec{\textit{KDVEM}}$$ : a $$k$$ -degree anonymity with vertex and edge modification algorithm

Similar Documents

Internet visualization

Sustainable mobile computing

From Methods to Images

Special issue on NETYS selected papers

Advances in mobile web information systems

Feature Point Tracking for Incomplete Trajectories

Adaptive Predictor for Lossless Image Compression

Semidefinite Programs and Association Schemes

Dynamic Programming Revisited: Improving Knapsack Algorithms

$$\varvec{\textit{KDVEM}}$$ : a $$k$$ -degree anonymity with vertex and edge modification algorithm