ACM Home Page
Please provide us with feedback. Feedback
A new permutation approach for distributed association rule mining
Full text PdfPdf (91 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the 14th ACM international conference on Information and knowledge management table of contents
Bremen, Germany
POSTER SESSION: Poster Session table of contents
Pages: 351 - 352  
Year of Publication: 2005
ISBN:1-59593-140-6
Authors
Yiqun Huang  Huazhong University of Science and Technology
Zhengding Lu  Huazhong University of Science and Technology
Heping Hu  Huazhong University of Science and Technology
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 54,   Citation Count: 0
Additional Information:

abstract   references   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/1099554.1099662
What is a DOI?

ABSTRACT

Privacy preserving distributed data mining has become a promising research area. This paper addresses the problem of association rule mining where the global database is vertically partitioned. When transactions are distributed in different sites, scalar product is a feasible tool to discover frequent itemsets. We present a new protocol to compute scalar product between two parties with a permutation approach. We analyze the protocol in detail and demonstrate its effectiveness and high privacy properties, and compare it to other published protocols.



Collaborative Colleagues:
Yiqun Huang: colleagues
Zhengding Lu: colleagues
Heping Hu: colleagues