Secure Mining of Association Rules in Horizontally Distributed Databases
Keywords:
Data Mining, Databases, Apriori Algorithm, FDM, Association Rule MiningAbstract
We propose a protocol for secure mining of association rules in horizontally distributed databases. Our protocol is optimized than the Fast Distributed Mining (FDM) algorithm which is an unsecured distributed version of the Apriori algorithm. The main purpose of our protocol is to remove the problem of mining generalized association rules that affects the existing system. Our protocol offers more enhanced privacy with respect to previous protocols. In addition, it is simpler and is optimized in terms of communication rounds, communication cost and computational cost than other protocols.
References
Ch. Aggarwal; Ph. Yu, “Privacy-Preserving Data Mining: Models and Algorithms”, Kluwer Academic publishers ,2007.
R. Agrawal; R. Srikant, “Fast algorithms for mining association rules,” Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, September, pp.487-499, 1994.
M. Kantarcioglu; C. Clifton, “Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data”, IEEE Trans. Knowl. Data Eng. 16(9): 1026-1037, 2004.
D. W.-L. Cheung; J. Han, V. Ng; A. W.-C. Fu; Y. Fu, “A fast distributed algorithm for mining association rules" Proceedings of the 1996 International Conference on Parallel and Distributed Information Systems (PDIS'96), Miami Beach, Florida, USA, Dec. 1996.
X. Yi; Y. Zhang, Privacy-preserving distributed association rule mining via semi-trusted mixer, Data and Knowledge Engineering, page 550–567, 2007.
Y. Lindell; B. Pinkas, “Privacy preserving data mining”,Advances in Cryptology, CRYPTO 2000 ,2000.
Y. Lindell; B. Pinkas, “Secure Multiparty Computation for Privacy-Preserving Data Mining”, Journal of Privacy and Confidentiality, 2008.
Ch.Ch Chang; J. Yeh; Y-Ch. Li, “Privacy-Preserving Mining of Association Rules on Distributed Databases”, IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.11, 2006.
A.A., Veloso; Jr.W. Meira; S. Parthasarathy; M.B. deCarvalho, “Efficient, accurate and privacy preserving data mining for frequent itemsets in distributed databases,”Proceedings of the Brazilian Symposium on Databases, Manaus, Amazonas, Brazil, pp.281-292, 2003.
W. Du; M. J. Atallah, “Secure multi-party computation problems and their applications: A review and open problems”, In Proceedings of the 2001 New Security Paradigms Workshop, Cloudcroft, New Mexico, 2001.
D. Chaum., "Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”. Communications of the ACM, 1981.
M. Reiter; A. Rubin., “Crowd: Anonymity for Web Transaction”, ACM Transactions on Information and System Security, 1998.
A. HajYasien, “Revisiting Protocol for Privacy Preserving Sharing Distributed Data: A Review with Recent Results”, Springer, pp. 542-555, 2011.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 COMPUSOFT: An International Journal of Advanced Computer Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.
