Mining Negative Association Rules in Distributed Environment

Aneesh K. Sahu, Raghvendra Kumar, Naazish Rahim · 2015

The main goal of data mining is to extract useful information from large amounts of database. However, data is often collected by several different sites. Among these, association rule mining has wide applications to find interesting relationships among attributes. In this paper we use concept of distributed database, when divided the centralize database into distributed database environment, database may be partitioned in different ways such as horizontally partitioned, vertically partitioned and mixed mode. The papers presents privacy preserving data mining algorithms operating over vertically partitioned database using the concepts of distribution privacy preservation and also reduce the time and space complexity with zero percentage of data leakage.

Read the paper · More papers on PaperTik