Issue No. 09 - September (2006 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.136
Sumit Sarkar , IEEE Computer Society
Due to growing concerns about the privacy of personal information, organizations that use their customers' records in data mining activities are forced to take actions to protect the privacy of the individuals. A frequently used disclosure protection method is data perturbation. When used for data mining, it is desirable that perturbation preserves statistical relationships between attributes, while providing adequate protection for individual confidential data. To achieve this goal, we propose a kd-tree based perturbation method, which recursively partitions a data set into smaller subsets such that data records within each subset are more homogeneous after each partition. The confidential data in each final subset are then perturbed using the subset average. An experimental study is conducted to show the effectiveness of the proposed method.
Privacy, data mining, data perturbation, microaggregation, kd-trees.
S. Sarkar and X. Li, "A Tree-Based Data Perturbation Approach for Privacy-Preserving Data Mining," in IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. , pp. 1278-1283, 2006.