• F. A. Patel
• Prof. A. S. Tamboli

In this paper we propose a protocol for secure mining of association rules in horizontally and vertically distributed databases. The current leading protocol is that of Kantarcioglu and Clifton[6] .This protocol is based on the Fast Distributed Mining (FDM) algorithm of Cheung et al[7]., which is an unsecured distributed version of the Apriori algorithm. The main goal of this protocol are two novel secure multi-party algorithms—one that computes the union of private subsets that each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset held by another. Our protocol provide enhanced privacy with respect to the other protocol . In addition, this horizontally and vertically distributed database is simpler and is significantly more efficient in terms of communication rounds and computational cost.

Privacy preserving data mining, distributed computation, frequent item sets, association rules, Apriori algorithm

"SECURE MINING OF ASSOCIATION RULES IN HORIZONTALLY AND VERTICALLY DISTRIBUTED DATABASES", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 11, page no.1-4, November-2018, Available :http://www.jetir.org/papers/JETIR1811001.pdf

"SECURE MINING OF ASSOCIATION RULES IN HORIZONTALLY AND VERTICALLY DISTRIBUTED DATABASES", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 11, page no. pp1-4, November-2018, Available at : http://www.jetir.org/papers/JETIR1811001.pdf