{'fraction_non_alphanumeric': 0.030563514804202482, 'fraction_numerical': 0.0019102196752626551, 'mean_word_length': 5.429447852760736, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
k-Anonymity via Clustering Domain Knowledge for Privacy Preservation

Preservation of privacy in micro-data release is a challenging task in data mining. The k-anonymity method has attracted much attention of researchers. Quasi-identifier is a key concept in k-anonymity. The tuples whose quasi-identifiers have near effect on the sensitive attributes should be grouped to reduce information loss. The previous investigations ignored this point. This paper studies k-anonymity via clustering domain knowledge. The contributions include: (a) Constructing a weighted matrix based on domain knowledge and proposing measure methods. It carefully considers the effect between the quasi-identifiers and the sensitive attributes. (b) Developing a heuristic algorithm to achieve k-anonymity via clustering domain knowledge based on the measure methods. (c) Implementing the algorithm for privacy preservation, and (d) Experiments on real data demonstrate that the proposed k-anonymous methods decrease 30% information loss compared with basic k-anonymity.