期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：8
DOI：10.15680/IJIRCCE.2015. 0308088
出版社：S&S Publications
摘要：The research in data mining is developing fast and efficient algorithm to derive knowledge from hugedatabases. There are several data mining algorithms available to solve diverse data mining problems. They are mainlyclassified as Associations, Classifications, Sequential Patterns and Clustering. Apriori is one of the most importantalgorithms used in Rule Association Mining. We propose a protocol for secure mining of association rules inhorizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton. Our protocol, liketheirs, is based on the Fast Distributed Mining (FDM) algorithm of Cheung et al., which is an unsecured distributedversion of the Apriori algorithm. The main ingredients in our protocol are two novel secure multi-party algorithms —one that computes the union of private subsets that each of the interacting players hold, and another that tests theinclusion of an element held by one player in a subset held by another. In addition, it is simpler and is significantlymore efficient in terms of communication rounds, communication cost and computational cost. The drawbacks of theexisting system may produce a larger number of candidate item sets and scan the database many times. The proposedalgorithm is based on the reverse scan of a given database. The proposed algorithm can greatly reduce the scanningtimes required for the discovery of candidate itemsets. Therefore, much time and space has been saved while searchingfrequent itemsets.
关键词：Data mining; Privacy Preserving Data Mining; Fast Distributed Mining Algorithm; Distributed;Computation.
