Mosul University
  • Register
  • Login
  • العربیة

AL-Rafidain Journal of Computer Sciences and Mathematics

Notice

As part of Open Journals’ initiatives, we create website for scholarly open access journals. If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at https://ejournalplus.com or
send us an email to info@ejournalplus.com

We will contact you soon

  1. Home
  2. Volume 10, Issue 1
  3. Authors

Current Issue

By Issue

By Subject

Keyword Index

Author Index

Indexing Databases XML

About Journal

Aims and Scope

Editorial Board

Editorial Staff

Publication Ethics

Indexing and Abstracting

Related Links

Peer Review Process

News

Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data

    Alaa Jumaa Sufyan T. F. Al-Janabi Nazar A. Ali

AL-Rafidain Journal of Computer Sciences and Mathematics, 2013, Volume 10, Issue 1, Pages 91-105
10.33899/csmj.2013.163427

  • Show Article
  • Download
  • Cite
  • Statistics
  • Share

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
  • PDF (524 K)
  • XML
(2013). Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data. AL-Rafidain Journal of Computer Sciences and Mathematics, 10(1), 91-105. doi: 10.33899/csmj.2013.163427
Alaa Jumaa; Sufyan T. F. Al-Janabi; Nazar A. Ali. "Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data". AL-Rafidain Journal of Computer Sciences and Mathematics, 10, 1, 2013, 91-105. doi: 10.33899/csmj.2013.163427
(2013). 'Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data', AL-Rafidain Journal of Computer Sciences and Mathematics, 10(1), pp. 91-105. doi: 10.33899/csmj.2013.163427
Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data. AL-Rafidain Journal of Computer Sciences and Mathematics, 2013; 10(1): 91-105. doi: 10.33899/csmj.2013.163427
  • RIS
  • EndNote
  • BibTeX
  • APA
  • MLA
  • Harvard
  • Vancouver
  • Article View: 45
  • PDF Download: 53
  • LinkedIn
  • Twitter
  • Facebook
  • Google
  • Telegram
  • Home
  • Glossary
  • News
  • Aims and Scope
  • Privacy Policy
  • Sitemap
This journal is licensed under a Creative Commons Attribution 4.0 International (CC-BY 4.0)

Powered by eJournalPlus