DocumentCode
1996872
Title
Extending l-Diversity for Better Data Anonymization
Author
Tian, Hongwei ; Zhang, Weining
Author_Institution
Dept. of Comput. Sci., Univ. of Texas at San Antonio, San Antonio, TX
fYear
2009
fDate
27-29 April 2009
Firstpage
461
Lastpage
466
Abstract
The notions of l-diversity provides a strong privacy guarantee for generalization. However, existing l-diversity algorithms may force users to choose between publishing no data or scarifying privacy if the data have a skewed distribution of SA values. In this paper, we solve this problem by extending l-diversity in two ways. First, we allow the generalization of SA values and second, we use a simple function to constraint frequencies of SA values. The resulting (tau, l)-diversity is more flexible and elaborate. We present an efficient heuristic algorithm that uses a novel order of quasi-identifier values to achieve (tau, l)-diversity. We compare our algorithm with two state-of-the-art algorithms based on existing l-diversity measures. Our preliminary experimental results indicate that our algorithm cannot only effectively deal with data with skewed SA distributions but also result in better utility of anonymous data in general.
Keywords
data privacy; security of data; constraint frequency; data anonymization; data privacy; heuristic algorithm; l-diversity; skewed distribution; state-of-the-art algorithms; Computer science; Data mining; Data privacy; Frequency estimation; Heuristic algorithms; Information technology; Liver diseases; Protection; Publishing; Taxonomy; Algorithm; Anonymization; Data Privacy; Experiments; Generalization;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-3770-2
Electronic_ISBN
978-0-7695-3596-8
Type
conf
DOI
10.1109/ITNG.2009.144
Filename
5070661
Link To Document