scholarly journals Customized Privacy Preservation Using Unknowns to Stymie Unearthing Of Association Rules

2007 ◽  
Vol 3 (11) ◽  
pp. 874-881 ◽  
Author(s):  
J. Indumathi ◽  
G.V. Uma
Author(s):  
G. Bhavani ◽  
S. Sivakumari

Data mining process extracts useful information from a large amount of data. The most interesting part of data mining is discovering the unseen patterns without unpacking sensitive knowledge. Privacy Preserving Data Mining abbreviated as PPDM deals with the issue of sustaining the privacy of information. This methodology covers the sensitive information from disclosure. PPDM techniques are established for hiding the sensitive information even after performing the data mining. One of the practices to hide the sensitive association rules is termed as association rule hiding. The main objective of association rule hiding algorithm is to slightly adjust the original database so that no sensitive association rule is derived from it. The following article presents a detailed survey of various association rule hiding techniques for preserving privacy in data mining. At first, different techniques developed by previous researchers are studied in detail. Then, a comparative analysis is carried out to know the limitations of each technique and then providing a suggestion for future improvement in association rule hiding for privacy preservation.


The process of deriving useful and knowledgeable information from enormous quantity of data is Data Mining. During mining procedures, handling of the sensitive data has become important to protect data against illegal attacks and malicious access either during transmission or at rest. Association rule algorithm is one of the rule extraction techniques. The rules determined are either to be transferred over the public networks or to be rested for further use.The main objective of the Field Level Security of the Sensitive Data in Large Datasets is to extract the strong association rules from the large data sets and the outcomes are crafted to conceal the sensitive data. The datasets and the association rules involving the attributes with relationships and dependencies are modified through several approaches and to see that no sensitive association rule is derived from it[1]. Privacy preservation of the sensitive association rules in large datasets is to provide secrecy for the sensitive data. Presently, it has become quite important to safeguard the privacy of the users’ personal data from unauthorized persons. The usage of association rules in voluminous datasets has emerged to be advantageous to organizations [2]. In this paper, we present a novel approach which is applied for hiding sensitive association rules by utilizing the techniques of compression, encryption method ology on the original dataset, providing dataset with better immunity.


2014 ◽  
Vol 14 (1) ◽  
pp. 52-71 ◽  
Author(s):  
A. Geetha Mary ◽  
D. P. Acharjya ◽  
N. Ch. S. N. Iyengar

Abstract In the present age of Internet, data is accumulated at a dramatic pace. The accumulated huge data has no relevance, unless it provides certain useful information pertaining to the interest of the organization. But the real challenge lies in hiding sensitive information in order to provide privacy. Therefore, attribute reduction becomes an important aspect for handling such huge database by eliminating superfluous or redundant data to enable a sensitive rule hiding in an efficient manner before it is disclosed to the public. In this paper we propose a privacy preserving model to hide sensitive fuzzy association rules. In our model we use two processes, named a pre-process and post-process to mine fuzzified association rules and to hide sensitive rules. Experimental results demonstrate the viability of the proposed research.


Sign in / Sign up

Export Citation Format

Share Document