Privacy Preserving Big Data Mining: Association Rule Hiding

Journal Title: Journal of Information Systems and Telecommunication - Year 2016, Vol 4, Issue 2

Abstract

Data repositories contain sensitive information which must be protected from unauthorized access. Existing data mining techniques can be considered as a privacy threat to sensitive data. Association rule mining is one of the utmost data mining techniques which tries to cover relationships between seemingly unrelated data in a data base.. Association rule hiding is a research area in privacy preserving data mining (PPDM) which addresses a solution for hiding sensitive rules within the data problem. Many researches have be done in this area, but most of them focus on reducing undesired side effect of deleting sensitive association rules in static databases. However, in the age of big data, we confront with dynamic data bases with new data entrance at any time. So, most of existing techniques would not be practical and must be updated in order to be appropriate for these huge volume data bases. In this paper, data anonymization technique is used for association rule hiding, while parallelization and scalability features are also embedded in the proposed model, in order to speed up big data mining process. In this way, instead of removing some instances of an existing important association rule, generalization is used to anonymize items in appropriate level. So, if necessary, we can update important association rules based on the new data entrances. We have conducted some experiments using three datasets in order to evaluate performance of the proposed model in comparison with Max-Min2 and HSCRIL. Experimental results show that the information loss of the proposed model is less than existing researches in this area and this model can be executed in a parallel manner for less execution time

Authors and Affiliations

Golnar Assadat Afzali, Shahriar Mohammadi

Keywords

Related Articles

Extracting Credit Rules from Imbalanced Data: The Case of an Iranian Export Development Bank

Credit scoring is an important topic, and banks collect different data from their loan applicant to make an appropriate and correct decision. Rule bases are of more attention in credit decision making because of their ab...

A Basic Proof Method for the Verification, Validation and Evaluation of Expert Systems

In the present paper, a basic proof method is provided for representing the verification, Validation and evaluation of expert systems. The result provides an overview of the basic method for formal proof such as: partiti...

Video Transmission Using New Adaptive Modulation and Coding Scheme in OFDM based Cognitive Radio

As Cognitive Radio (CR) used in video applications, user-comprehended video quality practiced by secondary users is an important metric to judge effectiveness of CR technologies. We propose a new adaptive modulation and...

Optimal Sensor Scheduling Algorithms for Distributed Sensor Networks

In this paper, a sensor network is used to estimate the dynamic states of a system. At each time step, one (or multiple) sensors are available that can send its measured data to a central node, in which all of processing...

Speech Emotion Recognition Based on Fusion Method

Speech emotion signals are the quickest and most neutral method in individuals’ relationships, leading researchers to develop speech emotion signal as a quick and efficient technique to communicate between man and machin...

Download PDF file
  • EP ID EP184430
  • DOI 10.7508/jist.2016.02.001
  • Views 124
  • Downloads 0

How To Cite

Golnar Assadat Afzali, Shahriar Mohammadi (2016). Privacy Preserving Big Data Mining: Association Rule Hiding. Journal of Information Systems and Telecommunication, 4(2), 70-77. https://europub.co.uk./articles/-A-184430