Main Article Content

Abstract

We propose a protocol for secure mining of association rules in vertically distributed databases. The current protocol is that of Kantarcioglu and Clifton two protocols to be used. In Our protocols, are based on the Fast Distributed Mining (FDM) algorithm of Cheung et al. In order to improve the performance of the system, proposed the subgroup detection concept in this system. In this setting, all sites use the same set of attributes and the quality of every subgroup depends on all databases. The approach finds patterns in the union of the databases, without disclosing the local databases. To the best of our knowledge, this is the first secure approach that tackles any of the supervised descriptive rule discovery tasks. In proposed scenario we will do the vertical distributed database which is nothing but different columns of a table distributed to different sites.

Article Details

How to Cite
Kokilavani. K, Nandhini. V, Mohan Arvainth. V, & T. Kalaikumaran. (2015). A NOVEL SECURE MINING OF ASSOCIATION RULES WITH SUBGROUP DISCOVERY IN VERTICALLY DISTRIBUTED DATABASES . International Journal of Intellectual Advancements and Research in Engineering Computations, 3(2), 43–48. Retrieved from https://ijiarec.com/ijiarec/article/view/1263