Skip to main content
Article thumbnail
Location of Repository

On multidimensional k-anonymity with local recoding generalization

By Yang Du, Tian Xia, Yufei Tao, Donghui Zhang and Feng Zhu

Abstract

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.

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1781
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.cuhk.edu.hk/~ta... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.