U.S. flag

An official website of the United States government

Skip Header


Using Simulated Annealing for k-anonymity

Written by:
RRS2002-07

Abstract

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 micro-aggregation process. The k-anonymity problem is known to be NP complete.

Related Information


Page Last Revised - October 28, 2021
Is this page helpful?
Thumbs Up Image Yes Thumbs Down Image No
NO THANKS
255 characters maximum 255 characters maximum reached
Thank you for your feedback.
Comments or suggestions?

Top

Back to Header