Abstract
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k − 1) other records in the dataset. The basic k-anonymization problem, which minimizes the number of dataset entries that must be suppressed to achieve k-anonymity, is NP-hard and hence not solvable both quickly and optimally in general. We apply parameterized complexity analysis to explore algorithmic options for restricted versions of this problem that occur in practice. We present the first fixed-parameter algorithms for this problem and identify key techniques that can be applied to this and other k-anonymization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 246–258. Springer, Heidelberg (2004)
Chaytor, R.: Utility Preserving k-Anonymity. Technical Report MUN-CS 2006-01, Dept.Computer Science, Memorial University of Newfoundland (2006)
Chaytor, R.: Allowing Privacy Protection Algorithms to Jump out of Local Optimums: An Ordered Greed Framework. In: Bonchi, F., et al. (eds.) PinKDD 2007. LNCS, vol. 4890, pp. 33–55. Springer, Heidelberg (2008)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
MacDonald, D.: Personal Communication (2005)
Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proc. of 23rd ACM Sym. on Principles of Database Systems (PODS 2004), pp. 223–228 (2004)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int’l J. on Uncertainty, Fuzziness and Knowledge-Based Systems 10(5), 571–588 (2002)
Wang, K., Yu, P., Chakraborty, S.: Bottom-up generalization: a data mining solution to privacy protection. In: ICDM 2004, pp. 249–256 (2004)
Wareham, T.: Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D.thesis, Dept.Computer Science, University of Victoria (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaytor, R., Evans, P.A., Wareham, T. (2008). Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)