Paper Details

This Privacy preserving is most popular study for the research field. Privacy means gives the protection to theprivate information at preserving time. In Market place, discovery of frequent item sets using association rules mining is oneof most important tasks in mining. Association rules is very helpful for finding frequent item sets to predicate about whichitem sets purchased together in a market and generate qualitative information that is useful for decision making. Fordistributed environment, database may be distributed as horizontally, vertically or mixed in computer network. The mainproblem in secure mining with the help of association rules is that transactions are distributed as vertically and the varioussites want to find frequent item sets by participating themselves without discovering their individual data. The proposedmethod will find frequent item sets for vertical distributed database with the help of data miner using encryption basedtechnique. Each sites prepare matrix with the local frequent item sets as per minimum support and encrypted it than send toother sites. The Scalar product with Boolean matrix is used for finding frequent item sets with secure computation betweenmultiple sites without disclosing private input which improved efficiency and privacy of system.

Jinkal Patel, Harish Dogiparthi, Deepak ganta, Kiran Loudya, Anusha Reddy, “An Efficient & Secure Mining for Vertical Distributed Database”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 3, Issue 12, pp. 45-51, December 2016.