Name
Title | ||
|---|---|---|
Achieving k-anonymity Using Improved Greedy Heuristics for Very Large Relational Databases. |
Abstract | ||
|---|---|---|
Advances in data storage, data collection and inference techniques have enabled the creation of huge databases of personal information. Dissemination of information from such databases-even if formally anonymised, creates a serious threat to individual privacy through statistical disclosure. One of the key methods developed to limit statistical disclosure risk is k-anonymity. Several methods have been proposed to enforce k-anonymity notably Samarati's algorithm and Sweeney's Datafly, which both adhere to full domain generalisation. Such methods require a trade off between computing time and information loss. This paper describes an improved greedy heuristic for enforcing k-anonymity with full domain generalisation. The improved greedy algorithm was compared with the original methods. Metrics like information loss, computing time and level of generalisation were deployed for comparison. Results show that the improved greedy algorithm maintains a better balance between computing time and information loss. |
Year | Venue | Keywords |
|---|---|---|
2013 | Transactions on Data Privacy | statistical disclosure,statistical disclosure risk,large relational databases,achieving k-anonymity,improved greedy algorithm,computing time,improved greedy heuristic,data storage,personal information,data collection,full domain generalisation,improved greedy heuristics,information loss |
DocType | Volume | Issue |
Journal | 6 | 1 |
ISSN | Citations | PageRank |
1888-5063 | 6 | 0.50 |
References | Authors | |
10 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Korra Sathya Babu | 1 | 36 | 10.34 |
| Nithin Reddy | 2 | 6 | 0.50 |
| Nitesh Kumar | 3 | 9 | 1.29 |
| Mark Elliot | 4 | 27 | 6.15 |
| Sanjay Kumar Jena | 5 | 101 | 14.37 |