DocumentCode
3322765
Title
OptRR: Optimizing Randomized Response Schemes for Privacy-Preserving Data Mining
Author
Huang, Zhengli ; Du, Wenliang
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Syracuse Univ., Syracuse, NY
fYear
2008
fDate
7-12 April 2008
Firstpage
705
Lastpage
714
Abstract
The randomized response (RR) technique is a promising technique to disguise private categorical data in privacy-preserving data mining (PPDM). Although a number of RR-based methods have been proposed for various data mining computations, no study has systematically compared them to find optimal RR schemes. The difficulty of comparison lies in the fact that to compare two PPDM schemes, one needs to consider two conflicting metrics: privacy and utility. An optimal scheme based on one metric is usually the worst based on the other metric. In this paper, we first describe a method to quantify privacy and utility. We formulate the quantification as estimate problems, and use estimate theories to derive quantification. We then use an evolutionary multi-objective optimization method to find optimal disguise matrices for the randomized response technique. The experimental results have shown that our scheme has a much better performance than the existing RR schemes.
Keywords
data mining; data privacy; evolutionary computation; matrix algebra; optimisation; security of data; evolutionary multiobjective optimization method; optimal disguise matrix; privacy-preserving data mining; private categorical data; randomized response scheme; Aggregates; Computer science; Data engineering; Data mining; Data privacy; Estimation theory; Mean square error methods; Optimization methods; Protection;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Conference_Location
Cancun
Print_ISBN
978-1-4244-1836-7
Electronic_ISBN
978-1-4244-1837-4
Type
conf
DOI
10.1109/ICDE.2008.4497479
Filename
4497479
Link To Document