CFP last date
20 May 2024
Reseach Article

Secure Extraction of Association Rule from Distributed Database

by Mahale Mohini V, Shaikh I.r.
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 117 - Number 3
Year of Publication: 2015
Authors: Mahale Mohini V, Shaikh I.r.
10.5120/20536-2896

Mahale Mohini V, Shaikh I.r. . Secure Extraction of Association Rule from Distributed Database. International Journal of Computer Applications. 117, 3 ( May 2015), 24-26. DOI=10.5120/20536-2896

@article{ 10.5120/20536-2896,
author = { Mahale Mohini V, Shaikh I.r. },
title = { Secure Extraction of Association Rule from Distributed Database },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 117 },
number = { 3 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 24-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume117/number3/20536-2896/ },
doi = { 10.5120/20536-2896 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:58:21.649208+05:30
%A Mahale Mohini V
%A Shaikh I.r.
%T Secure Extraction of Association Rule from Distributed Database
%J International Journal of Computer Applications
%@ 0975-8887
%V 117
%N 3
%P 24-26
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

There are many techniques to extract association rules from large datasets, but sometimes these datasets are distributed horizontally which is called strew database. In the strew database there are several sites or players that hold homogeneous database this database shares the same schema but hold information on different entities. For extracting association rules from such database the existing system is not so secure and efficient. The proposed system given here provides a secure and efficient solution for the problem stated above. Here we are going to use Fast Distributed mining (FDM) which is an unsecured distributed version of the Apriori algorithm. The proposed system gives enhanced version of FDM. Which offers enhanced privacy with respect to the protocol in [1] Also, it is more simple and significantly more effective in terms of communication rounds, communication cost and computational cost.

References
  1. M. Kantarcioglu and C. Clifton, "Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data," IEEE Trans. Knowledge and Data Eng. , vol. 16, no. 9, pp. 1026-1037, Sept. 2004.
  2. A. C. Yao, "Protocols for Secure Computation," Proc. 23rd Ann. Symp. Foundations of Computer Science (FOCS), pp. 160-164, 1982.
  3. Y. Lindell and B. Pinkas, "Privacy Preserving Data Mining," Proc. Crypto, pp. 36-54, 2000.
  4. X. Lin, C. Clifton, and M. Y. Zhu, "Privacy-Preserving Clustering with Distributed EM Mixture Modeling," Knowledge and Information Systems, vol. 8, pp. 68-81, 2005.
  5. J. Vaidya and C. Clifton, "Privacy Preserving Association Rule Mining in Vertically Partitioned Data," Proc. Eighth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 639- 644, 2002.
  6. J. Zhan, S. Matwin, and L. Chang, "Privacy Preserving Collaborative Association Rule Mining," Proc. 19th Ann. IFIP WG 11. 3 Working Conf. Data and Applications Security, pp. 153-165, 2005.
  7. A. Schuster, R. Wolff, and B. Gilburd, "Privacy-Preserving Association Rule Mining in Large-Scale Distributed Systems," Proc. IEEE Int'l Symp. Cluster Computing and the Grid (CCGRID), pp. 411-418,y 2004.
  8. L. Kissner and D. X. Song, "Privacy-Preserving Set Operations," Proc. 25th Ann. Int'l Cryptology Conf. (CRYPTO), pp. 241-257, 2005.
  9. T. ElGamal, "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," IEEE Trans. Information Theory, vol. IT-31, no. 4, July 1985.
Index Terms

Computer Science
Information Sciences

Keywords

Privacy preserving data mining distributed computation frequent item sets association rules