Privacy-preserving distributed mining of association rules on horizontally partitioned data
Top Cited Papers
- 26 July 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 16 (9) , 1026-1037
- https://doi.org/10.1109/tkde.2004.45
Abstract
Data mining can extract important knowledge from large data collections ut sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data and some types of information about the data. We address secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the information shared, while adding little overhead to the mining task.Keywords
This publication has 17 references indexed in Scilit:
- An efficient protocol for Yao's millionaires' problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Privacy preserving mining of association rulesPublished by Association for Computing Machinery (ACM) ,2002
- Maintaining Data Privacy in Association Rule MiningPublished by Elsevier ,2002
- On the design and quantification of privacy preserving data mining algorithmsPublished by Association for Computing Machinery (ACM) ,2001
- Privacy Preserving Data MiningPublished by Springer Nature ,2000
- Privacy-preserving data miningPublished by Association for Computing Machinery (ACM) ,2000
- CrowdsACM Transactions on Information and System Security, 1998
- Efficient mining of association rules in distributed databasesIEEE Transactions on Knowledge and Data Engineering, 1996
- A communication-privacy tradeoff for modular additionInformation Processing Letters, 1993
- New directions in cryptographyIEEE Transactions on Information Theory, 1976