论文信息 - Using Simulated Annealing for k-anonymity

Using Simulated Annealing for k-anonymity

In this note, we describe a method of simulated annealing for producing k-anonymity. For analytic purposes, there is no reason to expect that the method will be superior or worse than the method of applying genetic algorithms used by Iyengar (2002). The main appeal of simulated annealing is the amount of control it allows of the microaggregation process. The k-anonymity problem is known to be NP complete.

William E. Winkler | W. Winkler

[1] Vijay S. Iyengar,et al. Transforming data to satisfy privacy constraints , 2002, KDD.

[2] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[3] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4] Pierangela Samarati,et al. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression , 1998 .

[5] L. Sweeney. Computational Disclosure Control for Medical Microdata , 1997 .

[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[7] L. Willenborg,et al. Elements of Statistical Disclosure Control , 2000 .