Name
Abstract | ||
|---|---|---|
K-anonymity is one of the most important anonymity models that have been widely investigated and various techniques have been proposed to achieve it. Among them generalization is a common technique. In a typical generalization approach, tuples in a table was first divided into many QI(quasi-identifier)-groups such that the size of each QI-group is larger than K. In general, utility of anonymized data can be enhanced if size of each QI-group is reduced. Motivated by this observation, we propose linking-based anonymity model, which achieves K-anonymity with QI-groups having size less than K. To implement linking-based anonymization model, we propose a simple yet efficient heuristic local recoding method. Extensive experiments on real data sets are also conducted to show that the utility has been significantly improved by our approach compared to the state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-12206-9_15 | CONCEPTUAL MODELING |
Keywords | Field | DocType |
privacy preservation, K-anonymity, linking-based anonymization, Heterogenous Generalization | Data mining,Data set,Heuristic,Computer science,Tuple,k-anonymity,Data publishing,Anonymity,Database | Conference |
Volume | ISSN | Citations |
8824 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianmang He | 1 | 23 | 3.91 |
| Dong Li | 2 | 475 | 67.20 |
| Yanni Hao | 3 | 3 | 0.73 |
| HuaHui Chen | 4 | 17 | 5.75 |