Hiding Sensitive Association Rules over Privacy Preserving Distributed Data Mining | ||
| Kirkuk Journal of Science | ||
| Article 1, Volume 9, Issue 1, June 2014, Pages 59-72 PDF (0 K) | ||
| DOI: 10.32894/kujss.2014.89609 | ||
| Authors | ||
| Alaa Khalil Jumaa; Sufyan T. F. Al-Janabi; Nazar Abedlqader Ali | ||
| Abstract | ||
| The problem of Privacy Preserving Data Mining (PPDM) has become more important in recent years because of the increasing ability to store personal data about users, and the increasing sophistication of data mining algorithms. A number of techniques have been suggested in recent years in order to perform PPDM. These techniques are used to study different transformation methods associated with privacy. In this paper, a system for PPDDM of association rules is proposed. This system works under the common and realistic assumptions that parties are semi-honest, Semi-Trusted Third Party (STTP) and the databases are horizontally distributed over these parties. New algorithm for hiding sensitive rules is presented in this system. The experimental results for this algorithm has shown that it have good hiding accuracy with acceptable level of side effects when it compared with the same algorithm in centralized system and other existing algorithms in distributed database system. Furthermore, the proposed system uses the Secure Socket Layer (SSL) with commutative encryption to support the certifications and security over system various components. | ||
| Keywords | ||
| datamining; semi; honest; associationrules; distributeddatabase; commutative encryption | ||
|
Statistics Article View: 232 PDF Download: 151 |
||