Sciweavers

Share
KDD
2004
ACM

Optimal randomization for privacy preserving data mining

10 years 1 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individual privacy, optimal randomization schemes need to be employed. This paper demonstrates the construction of optimal randomization schemes for privacy preserving density estimation. We propose a general framework for randomization using mixture models. The impact of randomization on data mining is quantified by performance degradation and mutual information loss, while privacy and privacy loss are quantified by interval-based metrics. Two different types of problems are defined to identify optimal randomization for PPDM. Illustrative examples and simulation results are reported. Categories and Subject Descriptors H.2.8 [Database Management]: Database Applications— Data mining; H.2.0 [Database Management]: General— Security, integrity, and protection General Terms Theory, Algorithms, Security Keywords m...
Michael Yu Zhu, Lei Liu
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where KDD
Authors Michael Yu Zhu, Lei Liu
Comments (0)
books