Secure Distributed Data Mining

Priyanka Khairnar, Dipak V. Patil


Data mining on a large dataset is a complex and time consuming task. The mining process on this large volume of data becomes slow, as it has to be done serially. The solution to the problem is to accelerate the mining process with the help of parallel or distributed approaches. Through mining, interesting relations and patterns between variables of large database can be observed securely using cryptographic techniques and the mining algorithms. This paper addresses the problem of secure distributed association rule mining over the horizontally distributed database. Security is the main problem in association rule mining projects. The solution to the problem is to accelerate the learning process with the help of parallel or distributed approaches. As mentioned earlier the performance of data mining algorithm can be enhanced from O(N) to O(N/k) with parallelism, where N = number of data instances and k=number of nodes [2]. There are several sites in the transaction. This system is based on distributed mining algorithm, K&C algorithm and AES algorithm. Distributed mining algorithm proposed here is the distributed version of apriori algorithm. The cryptographic technique is used to provide security in order to minimize the information shared in mining. With proposed method speed up is acquired while preserving the privacy of the data.

Full Text:



T. Tassa, Secure Mining of association rules in horizontally distributed Database"proc, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 4, APRIL 2014

G. Alex and A. Freitas, Scalable, high-performance data mining with parallel processing,in Principles and Practice of Knowledge Discovery in Databases,(Nantes, France),1998.

R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large Database". In VLDB, pages 487499, 1994.

A.V. Ev_mievski, R. Srikant, R. Agrawal, and J. Gehrke, Privacy preservingmining of association rules.In KDD, pages 217228, 2002.

D.W.L. Cheung, J. Han, V.T.Y. Ng, A.W.C. Fu, and Y. Fu, A fast distributed algorithm for mining association rules. In PDIS, pages 3142, 1996.

R.L. Rivest, A. Shamir, and L.M. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Comm.ACM, vol. 21, no. 2, pp. 120-126, 1978.

A. Ben-David, N. Nisan, and B. Pinkas, Fair play MP - A System for Secure Multi-Party Computation ,Proc. 15th ACM Conf Computer and Communication Security(CCS), pp. 257-266, 2008.

M. Kantarcioglu and C. Clifton, Privacy-preserving distributed mining of association rules on horizontally partitioned data", IEEE Transactions on Knowledge and Data Engineering, 16:10261037, 2004.

T. Tassa and E. Gudes. Secure distributed computation of anonymized views of shared database", Transactions on Database Systems, 37, Article 11,2012.

D.W.L. Cheung, J. Han, V.T.Y. Ng, A.W.C. Fu, and Y. Fu, A Fast DistributedAlgorithm for Mining Association Rules.

J. Brickell and V. Shmatikov, Privacy-preserving graph algorithms in the semi honest model", In ASIACRYPT, pages 236252, 2005.

J.S. Park , M. Chen, and P.S. Yu , An effective Hash Based Algorithm for MiningAssociation Rules, "Proc. 1995 ACM SIGMOD Int'l Conf. Managementof Data , ACM Press, 1995, pp. 175-186.

Priyanka khairnar "Secure Distributed Data Mining", IJCA Proceedings on Innovations and Trends in Computer and Communication Engineering(ITCCE), pp. 9-12, Dec 2014.

C. Ray, Distributed database systems. Pearseron Education India, 2009.


  • There are currently no refbacks.

Copyright © IJETT, International Journal on Emerging Trends in Technology