We study on the privacy preserving data mining, PPDM for short, by using randomization. The theoretical PPDM based on the secure multi-party computation techniques is not practical for its computational inefficiency. So we concentrate on a practical PPDM, especially randomization technique. We survey various privacy measures and study on the privacy preserving mining of association rules by using randomization. We propose a new randomization operator, binomial selector, for privacy preserving technique of association rule mining. A binomial selector is a special case of a select-a-size operator by Evfimievski et al.[3]. Moreover we present some simulation results of detecting an appropriate parameter for a binomial selector. The randomization by a so-called cut-and-paste method in [3] is not efficient and has high variances on recovered support values for large item-sets. Our randomization by a binomial selector make up for this defects of cut-and-paste method.
[1]
Tomasz Imielinski,et al.
Mining association rules between sets of items in large databases
,
1993,
SIGMOD Conference.
[2]
Rathindra Sarathy,et al.
A theoretical basis for perturbation methods
,
2003,
Stat. Comput..
[3]
George T. Duncan,et al.
Disclosure-Limited Data Dissemination
,
1986
.
[4]
Rakesh Agrawal,et al.
Privacy-preserving data mining
,
2000,
SIGMOD 2000.
[5]
Alexandre V. Evfimievski,et al.
Privacy preserving mining of association rules
,
2002,
Inf. Syst..
[6]
Charu C. Aggarwal,et al.
On the design and quantification of privacy preserving data mining algorithms
,
2001,
PODS.
[7]
Chris Clifton,et al.
Privacy-preserving data mining: why, how, and when
,
2004,
IEEE Security & Privacy Magazine.
[8]
J. Ross Quinlan,et al.
Induction of Decision Trees
,
1986,
Machine Learning.