ACM Home Page
Please provide us with feedback. Feedback
Privacy preserving association rule mining in vertically partitioned data
Full text PdfPdf (602 KB)
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
POSTER SESSION: Poster papers table of contents
Pages: 639 - 644  
Year of Publication: 2002
ISBN:1-58113-567-X
Authors
Jaideep Vaidya  Purdue University, West Lafayette, Indiana
Chris Clifton  Purdue University, West Lafayette, Indiana
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): 41,   Downloads (12 Months): 270,   Citation Count: 94
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.775142
What is a DOI?

ABSTRACT

Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each site holds some attributes of each transaction, and the sites wish to collaborate to identify globally valid association rules. However, the sites must not reveal individual transaction data. We present a two-party algorithm for efficiently discovering frequent itemsets with minimum support levels, without either site revealing individual transaction values.


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
 
7
 
8
9
 
10
 
11
Ford Motor Corporation. Corporate citizenship report. http://www.ford.com/en/ourCompany/community And Culture/buildingRelationships/strategicIssues/firestoneTireRecall.htm, May 2001.
12
 
13
 
14
M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02), June 2 2002.
 
15
 
16
National Highway Traffic Safety Administration. Firestone tire recall. http://www.nhtsa.dot.gov/hot/Firestone/Index.html, May 2001.
 
17
A. Prodromidis, P. Chan, and S. Stolfo. Meta-learning in distributed data mining systems: Issues and approaches, chapter 3. AAAI/MIT Press, 2000.
 
18
S. J. Rizvi and J. R. Haritsa. Privacy-preserving association rule mining. In Proceedings of 28th International Conference on Very Large Data Bases. VLDB, Aug. 20--23 2002.
 
19
R. Wirth, M. Borth, and J. Hipp. When distribution is part of the semantics: A new problem class for distributed knowledge discovery. In Ubiquitous Data Mining for Mobile and Distributed Environments workshop associated with the Joint 12th European Conference on Machine Learning (ECML'0I) and 5th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'01), Freiburg, Germany, Sept. 3--7 2001.
 
20
A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162--167. IEEE, 1986.

CITED BY  94

Collaborative Colleagues:
Jaideep Vaidya: colleagues
Chris Clifton: colleagues