Highly efficient optimal k-anonymity for biomedical datasets.

Florian Kohlmayer Fabian Prasser Claudia Eckert Alfons Kemper Klaus A. Kuhn

Published in: CBMS (2012)

Keyphrases

highly efficient
low cost
low complexity
dynamic programming
biomedical data
optimal solution
evolutionary algorithm
lower bound
information loss
real time
text mining
data privacy
privacy protection
sat solvers
attribute values
information extraction
computational complexity
genetic algorithm
data sets