Privacy preserving mining of association rulesin horizontally distributed databases

This paper, provide a secure mining in horizontally distributed databases by using association rules. We used Fast Distributed Mining (FDM) algorithm which is unsecured distributed version of the Apriori algorithm. Horizontally Distributed Databases divides the relation tuples, so that first subset of rows is present within the site 1 and another subset is present within the site 2. Original relation is obtained by taking union of all the sets. Association rules are if/then statements that help uncover relationships between unrelated data relational database and other information repository.