- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 7, Volume 10, Issue 1, 2013, Pages 91-105 PDF (524.44 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2013.163427 | ||
| Authors | ||
| Alaa Jumaa1; Sufyan T. F. Al-Janabi2; Nazar A. Ali3 | ||
| 1Computer Science Institute University of Polytechnic, Sulaimaniya, Iraq | ||
| 2College of Computer University of Anbar, Anbar, Iraq | ||
| 3College of Administration University of Sulaimaniya, Iraq | ||
| Abstract | ||
| Data mining is the process of extracting hidden patterns from data. One of the most important activities in data mining is the association rule mining and the new head for data mining research area is privacy of mining. Privacy preserving data mining is a new research trend in privacy data for data mining and statistical database. Data mining can be applied on centered or distributed databases. Most efficient approaches for mining distributed databases suppose that all of the data at each site can be shared. Privacy concerns may prevent the sites from directly sharing the data, and some types of information about the data. Privacy Preserving Data Mining (PPDM) has become increasingly popular because it allows sharing of privacy sensitive data for analysis purposes. In this paper, the problem of privacy preserving association rule mining in horizontally distributed database is addressed by proposing a system to compute a global frequent itemsets or association rules from different sites without disclosing individual transactions. Indeed, a new algorithm is proposed to hide sensitive frequent itemsets or sensitive association rules from the global frequent itemsets by hiding them from each site individually. This can be done by modifying the original database for each site in order to decrease the support for each sensitive itemset or association rule. Experimental results show that the proposed algorithm hides rules in a distributed system with the good execution time, and with limited side effects. Also, the proposed system has the capability to calculate the global frequent itemsets from different sites and preserves the privacy for each site. | ||
| Keywords | ||
| Cryptography; Data Mining; Distributed Database; frequent itemsets; sensitive association rules | ||
|
Statistics Article View: 307 PDF Download: 327 |
||