Sciweavers

ICDE
2007
IEEE

On Multidimensional k-Anonymity with Local Recoding Generalization

14 years 5 months ago
On Multidimensional k-Anonymity with Local Recoding Generalization
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-hard both to find the table with the maximum quality, and to discover a solution with an approximation ratio at most 5/4. Then, we develop an algorithm with good balance between the approximation ratio and time complexity. The quality of our solution is verified by experiments.
Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng
Added 01 Nov 2009
Updated 01 Nov 2009
Type Conference
Year 2007
Where ICDE
Authors Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng Zhu
Comments (0)