##plugins.themes.academic_pro.article.main##
Abstract
We consider the problem of secure mining of generalized association rules from horizontally distributed databases. Given a large horizontally distributed database of transactions, where each transaction consists of a set of items and taxonomy on the items, we find associations between items at any level of the taxonomy. Generalized association rule mining technique has discussed in many papers. But, in this paper we discuss about secure mining of generalized association rules from horizontally distributed databases or homogeneous databases. For that purpose, we use the same privacy preserving distributed mining concepts discussed in paper [1] with the generalized association rule mining technique called ‘cumulate’ algorithm discussed in paper [2]. The main privacy preserving parts of the protocol in paper [1] are two secure multi-party algorithms called UNIFI and SETINC. Our proposed protocol is based on Fast Distributed Mining (FDM) algorithm. FDM algorithm is an unsecured distributed version of Apriori algorithm. It offers enhanced privacy, simplicity and efficiency.
Keywords: Privacy Preserving Data Mining, Horizontally Distributed Databases, Generalized Association ruldes, Frequent Itemsets..##plugins.themes.academic_pro.article.details##
References
2. R. Srikant and R. Agrawal, “Mining generalized association rulesâ€, InVLDB, pages 407–419, 1995.
3. M. Kantarcioglu and C. Clifton, “Privacy-preserving distributed mining of association rules on horizontally partitioned dataâ€, IEEE Transactions on Knowledge and Data Engineering, 16:1026–1037, 2004.
4. R. Agrawal and R. Srikant, “Fast algorithms for mining association rules in large databasesâ€, In VLDB, pages 487–499, 1994.
5. 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 31–42, 1996.
6. A.V. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy preserving mining of association rulesâ€, In KDD, pages 217–228, 2002.
7. J. Vaidya and C. Clifton, “Privacy preserving association rule mining in vertically partitioned dataâ€, In KDD, pages 639–644, 2002.
8. J. Zhan, S. Matwin, and L. Chang, “ Privacy preserving collaborative association rule miningâ€, In Data and Applications Security, pages 153–165, 2005.
9. R. Agrawal and R. Srikant, “Privacy-preserving data miningâ€, In SIGMOD Conference, pages 439–450, 2000.
10. M. Kantarcioglu, R. Nix, and J. Vaidya, “ An efficient approximate protocol for privacy-preserving association rule miningâ€, In PAKDD, pages 515–524, 2009.
11. J.S. Park, M.S. Chen, and P.S. Yu, “An effective hash based algorithm for mining association rulesâ€, In SIGMOD Conference, pages 175–186, 1995.
12. A. Schuster, R. Wolff, and B. Gilburd, “Privacy-preserving association rule mining in large-scale distributed systemsâ€, In CCGRID, pages 411– 418, 2004.
13. A.C. Yao, “Protocols for secure computationâ€, In FOCS, pages 160–164, 1982.
14. A. Ben-David, N. Nisan, and B. Pinkas, “FairplayMP - A system for secure multi-party computationâ€, In CCS, pages 257–266, 2008.
15. H. Grosskreutz, B. Lemmen, and S. R¨uping, “Secure distributed subgroup discovery in horizontally partitioned dataâ€, Transactions on Data Privacy, 4:147–165, 2011.