Abstract: Association Rule mining is one among the data mining technique employed in distributed databases. This technique disclose some attention grabbing relationship between locally massive associate degreed globally massive itemsets and proposed an algorithm, Fast distributed mining of association(FDM) , unsecured distributed version of Apriori algorithm and generates a low range of candidate sets and well reduces the amount of message to be passed at mining association rules. Two secure multi party algorithms are main ingredients in our protocol. One that computes the union of private subsets that every of the interacting players hold, and another that tests the inclusion of element by one player in a subset held by another. This protocol offers increased privacy with relation to the protocol and additionally, it is less complicated and considerably a lot of efficient in terms of Communication rounds, communication cost and computation cost.
Keywords: Privacy Preserving Data Mining, Association Rules, Distributed Databases.