{'fraction_non_alphanumeric': 0.019337016574585635, 'fraction_numerical': 0.0, 'mean_word_length': 5.304347826086956, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Highly efficient optimal k-anonymity for biomedical datasets

K-anonymization is a wide-spread technique for the de-identification of biomedical datasets. To not render the data useless for further analysis it is often important to find an optimal solution to the k-anonymity problem, i.e., a transformation with minimum information loss. As performance is often a key requirement this paper describes an efficient implementation of a k-anonymization algorithm which is especially suitable for biomedical datasets. Although our basic implementation already offers excellent performance we present several further optimizations and show that these yield an additional speedup of up to a factor offive even for large datasets.