Abstract:
K-anonymity is an important privacy preserving model in the data publishing scenario. The algorithms on dataset K-anonymization are researched extensively in recent years, Median Mondrian algorithm is the only multidimensional K-anonymity partition method. However, our research shows that Median Mondrian algorithm is not well-balanced on dealing with the contradiction between data partition precision and data privacy preserving. In this paper, we propose an entropy-based multidimensional K-anonymity partition method and a new evaluation measure on K-anonymization results. The experimental results show that our new method is feasible and preserves the privacy much more efficiently than Median Mondrian algorithm.