A Novel Approach for Secure Mining of Horizontally Distributed Databases?

The current protocols for secure mining of association rules in horizontally distributed databases has different Problems like privacy. In this kind of scenario Different players may wish to protect & preserve their data and metadata about their information. The approach is based on the Fast Distributed Mining (FDM) algorithm which is devised by Cheung [5]. FDM is distributed version of the Apriori algorithm and unsecured too. Most importantly these protocols provides two fresh secure algorithms (sub protocols) ? the union of private subsets that each of the participating players hold is carried out by one and other one checks for the inclusion of an element held by one of the player in a subset which is held by another. Our systems provides optimized privacy with respect to the protocol in [7] using Symmetric Key Cryptography. In addition, relatively it is more efficient in terms of computational cost, communication rounds and also in communication cost because of MAP/REDUCE