Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

KDD
2007
ACM

favoriteEmaildiscussreport

121views Data Mining» more KDD 2007»

Preserving the Privacy of Sensitive Relationships in Graph Data

14 years 5 months ago

Preserving the Privacy of Sensitive Relationships in Graph Data

Download www.utdallas.edu

Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships from anonymized graph data as link reidentification. We propose five different privacy preservation strategies, which vary in terms of the amount of data removed (and hence their utility) and the amount of privacy preserved. We assume the adversary has an accurate predictive model for links, and we show experimentally the success of different link re-identification strategies under varying structural characteristics of the data.

Elena Zheleva, Lise Getoor

Real-time Traffic

Anonymized Graph Data | Data Mining | KDD 2007 | Privacy Preservation Strategies | Sensitive Relationships |

claim paper

Related Content

» Privacy Preservation in Social Networks with Sensitive Edge Weights

» PrivacyPreserving Query over Encrypted GraphStructured Data in Cloud Computing

» On Link Privacy in Randomizing Social Networks

» On Link Privacy in Randomizing Social Networks

» A Distributed PrivacyPreserving Association Rules Mining Scheme Using FrequentPattern Tree

» Preservation of proximity privacy in publishing numerical sensitive data

» FineGrain Perturbation for Privacy Preserving Data Publishing

» LCover Preserving Diversity by Anonymity

» Quantification of a Privacy Preserving Data Mining Transformation

Post Info
More Details (n/a)

Added	30 Nov 2009
Updated	30 Nov 2009
Type	Conference
Year	2007
Where	KDD
Authors	Elena Zheleva, Lise Getoor

Comments (0)