Graph Modification Approaches

Graph Modification Approaches

DOI: 10.4018/978-1-5225-5158-4.ch005
OnDemand PDF Download:
No Current Special Offers


This chapter contains some of the most recent techniques and algorithms on social network anonymisation. The authors start with the random perturbation algorithms like the UMGA algorithm and constrained perturbation algorithms like the fast k-degree anonymization (FKDA) algorithm. Then they move to the anonymisation technique, noise nodes addition, and present an algorithm based upon this approach. Next, the authors move on to α-anonymization, (α, k) anonymity, (α, l) diversity, and recursive (α, c, l) diversity anonymisation algorithms, which are generalisations in that order.
Chapter Preview

Random Perturbation

These methods involve adding random noise to the data. They protect against re-identification in a probabilistic manner. In this section, we will look at an algorithm called the UMGA Algorithm.

Complete Chapter List

Search this Book: