ליאור רוקח

Privacy preserving data mining aims to prevent the violation of privacy that might result from mining of sensitive data. This is commonly achieved by data anonymization. One way to anonymize data is adherence to the k-anonymity concept which requires that the probability to identify an individual by linking databases not to exceed 1/k. In this paper we propose an algorithm which utilizes rough set theory to achieve k-anonymity. The basic idea is to partition the original dataset into several disjoint reducts such that each one of them adheres to k-anonymity. We show that it is easier to make each reduct comply with k-anonymity if it does not contain all quasi-identifier attributes. Moreover, our procedure ensures that even if the attacker attempts to rejoin the reducts, the kanonymity is still preserved.