ACM Home Page
Please provide us with feedback. Feedback
Privacy preserving mining of association rules
Full text PdfPdf (1.05 MB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Edmonton, Alberta, Canada
SESSION: Frequent patterns II table of contents
Pages: 217 - 228  
Year of Publication: 2002
ISBN:1-58113-567-X
Authors
Alexandre Evfimievski  IBM Almaden Research Center, San Jose, CA
Ramakrishnan Srikant  IBM Almaden Research Center, San Jose, CA
Rakesh Agrawal  IBM Almaden Research Center, San Jose, CA
Johannes Gehrke  IBM Almaden Research Center, San Jose, CA
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
: AAAI
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 111,   Citation Count: 98
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775047.775080
What is a DOI?

ABSTRACT

We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transactions. While it is feasible to recover association rules and preserve privacy using a straightforward "uniform" randomization, the discovered rules can unfortunately be exploited to find privacy breaches. We analyze the nature of privacy breaches and propose a class of randomization operators that are much more effective than uniform randomization in limiting the breaches. We derive formulae for an unbiased support estimator and its variance, which allow us to recover itemset supports from randomized datasets, and show how to incorporate these formulae into mining algorithms. Finally, we present experimental results that validate the algorithm by applying it on real datasets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
 
5
 
6
R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. Research Report RJ 9839, IBM Almaden Research Center, San Jose, California, June 1994.
7
8
 
9
L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, Belmont, 1984.
 
10
Business Week. Privacy on the Net, March 2000.
 
11
C. Clifton and D. Marks. Security and privacy implications of data mining. In ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pages 15--19, May 1996.
12
 
13
L. Cranor, J. Reagle, and M. Ackerman. Beyond concern: Understanding net users' attitudes about online privacy. Technical Report TR 99.4.3, AT&T Labs--Research, April 1999.
14
 
15
The Economist. The End of Privacy, May 1999.
 
16
 
17
European Union. Directive on Privacy Protection, October 1998.
 
18
 
19
 
20
Office of the Information and Privacy Commissioner, Ontario. Data Mining: Staking a Claim on Your Privacy, January 1998.
 
21
 
22
 
23
K. Thearling. Data mining and privacy: A conflict in making. DS*, March 1998.
 
24
Time. The Death of Privacy, August 1997.
25
 
26
S. Warner. Randomized response: A survey technique for eliminating evasive answer bias. J. Am. Stat. Assoc., 60(309):63--69, March 1965.
 
27
A. Westin. E-commerce and privacy: What net users want. Technical report, Louis Harris & Associates, June 1998.
 
28
A. Westin. Privacy concerns & consumer choice. Technical report, Louis Harris & Associates, Dec. 1998.
 
29
A. Westin. Freebies and privacy: What net users think. Technical report, Opinion Research Corporation, July 1999.

CITED BY  98

Collaborative Colleagues:
Alexandre Evfimievski: colleagues
Ramakrishnan Srikant: colleagues
Rakesh Agrawal: colleagues
Johannes Gehrke: colleagues