Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Approximate algorithms with generalizing attribute values for k-anonymity
Park H., Shim K. Information Systems35 (8):933-955,2010.Type:Article
Date Reviewed: Jan 3 2011

There are many occasions when datasets containing person-specific information have to be published or communicated to untrusted parties in order to support, for example, intended research studies. In all such cases, existing privacy laws--both in the US and the EU--require that the data be published in an anonymous form. To facilitate data anonymization, several interesting algorithms have been proposed in the last few years that aim to find a good balance between the conflicting goals of data privacy and data utility, while minimizing the information loss incurred due to the anonymization process.

This paper proposes several O(log k)-approximation algorithms for achieving k-anonymity by attribute-values generalization through the use of hierarchies. The authors develop O(&bgr; log k)-approximation algorithms whose runtime can be adjusted based on the user-specified parameter &bgr; that sets the tolerance of the approximation ratio. The experimental evaluation of the proposed algorithms demonstrates that these approaches achieve better performance than traditional approaches, both in terms of approximation ratios and execution time.

The paper is generally well structured and written, with several examples that help the reader gain a good understanding of the details of the proposed methodologies. The algorithms are extensively evaluated against other state-of-the-art methods for local recoding, under various settings, and on four different real-life datasets.

Reviewer:  Aris Gkoulalas-Divanis Review #: CR138679 (1106-0644)
Bookmark and Share
Nonnumerical Algorithms And Problems (F.2.2 )
Graph Algorithms (G.2.2 ... )
Security and Protection (K.6.5 )
Would you recommend this review?
Other reviews under "Nonnumerical Algorithms And Problems": Date
Improving the performance guarantee for approximate graph coloring
Wigderson A. Journal of the ACM 30(4): 729-735, 1983. Type: Article
Feb 1 1985
Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
Demel J., Demlová M., Koubek V. Theoretical Computer Science 36(2-3): 203-216, 1985. Type: Article
Jan 1 1986
Complexity of the word problem for commutative semigroups of fixed dimension
Huynh D. Acta Informatica 22(4): 421-432, 1985. Type: Article
May 1 1986

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy