Zheleva and Getoor, WWW2009, PinKDD2007 paper comparison

The papers

Both the papers have been written by the same authors but deal with slightly different albeit related topics.

• Zheleva_and_Getoor,_WWW2009
• Preserving the privacy of sensitive relationships in graph data. PinKDD, 2007

Problem

The two papers deal with two different aspects of privacy preservation in anonymized data. The first paper attempts to show how an adversary can predict private attributes of users in a social network by exploiting information about friendship links and group membership. The second paper shows how it is possible to infer sensitive/private relationships in graph data even when all of the sensitive edge data has been removed.

Dataset

In the first paper, the authors test their methods on a large number of real-world datasets that include data from [UsesDataset::Flickr ]], Facebook, Dogster and BibSonomy. In the second paper, the authors generated synthetic graph data with varying statistical and structural assumptions to test how much link information can be disclosed under different anonymization strategies.

Questions

1. How much time did you spend reading the (new, non-wikified) paper you summarized?

1 hour

2. How much time did you spend reading the old wikified paper?

20 min

3. How much time did you spend reading the summary of the old paper?

10 min

4. How much time did you spend reading background materiel?

30 min

5. Was there a study plan for the old paper? if so, did you read any of the items suggested by the study plan? and how much time did you spend with reading them?

No study plan

6. Give us any additional feedback you might have about this assignment.