An Efficient Association Rule Hiding Algorithm for Privacy Preserving Data Mining
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 7
Abstract
The security of the large database that contains certain crucial information, it will become a serious issue when sharing data to the network against unauthorized access. Privacy preserving data mining is a new research trend in privacy data for data mining and statistical database. Association analysis is a powerful tool for discovering relationships which are hidden in large database. Association rules hiding algorithms get strong and efficient performance for protecting confidential and crucial data. Data modification and rule hiding is one of the most important approaches for secure data. The objective of the proposed Association rule hiding algorithm for privacy preserving data mining is to hide certain information so that they cannot be discovered through association rule mining algorithm. The main approached of association rule hiding algorithms to hide some generated association rules, by increase or decrease the support or the confidence of the rules. The association rule items whether in Left Hand Side (LHS) or Right Hand Side (RHS) of the generated rule, that cannot be deduced through association rule mining algorithms. The concept of Increase Support of Left Hand Side (ISL) algorithm is decrease the confidence of rule by increase the support value of LHS. It doesn’t work for both side of rule; it works only for modification of LHS. In Decrease Support of Right Hand Side (DSR) algorithm, confidence of the rule decrease by decrease the support value of RHS. It works for the modification of RHS. We proposed a new algorithm solves the problem of them. That can increase and decrease the support of the LHS and RHS item of the rule correspondingly so that more rule hide less number of modification. The efficiency of the proposed algorithm is compared with ISL algorithms and DSR algorithms using real databases, on the basis of number of rules hide, CPU time and the number of modifies entries and got better results.
Authors and Affiliations
Yogendra Kumar Jain , Vinod Kumar Yadav , Geetika S. Panday
Keywords
Related Articles
- EP ID EP102878
- DOI -
- Views 128
- Downloads 0
An Analysis of Irregularities in Devanagari Script Writing – A Machine Recognition Perspective
Abstract— This paper deals with the theoretical analysis of Devanagari script according to machine recognition perspective. An individual having good knowledge of the script of a language can easily read some words writt...
Multiframe Image Super-resolution – A Comparison
The subject of resolution enhancement has become one of the most important digital processing applications in recent years. This paper focuses on comparison of two multiframe image super-resolution algorithms. Variety of...
Fuzzy Group Decision Making Using Surrogate Worth Trade-Off Method
In this paper, fuzzy theory is used in group decision making problem. Surrogate worth trade-off method is discussed and according to fuzzy aspect of human decisions, linguistic variables are applied to state the Decision...
REVOLUTIONARY EXTENDED SPATIAL POINT EXTRACTION USING CIRCULAR TECHNIQUE (RESPECT)
we are here proposing a new algorithm to make a simpler approach to Fingerprint Recognition, to reduce False Rejection due to accident and to reduce the problem due to shrinking of finger due to winter season or water, n...
WEIGHTAGE FACTOR BASED SCHEME FOR PERFORMANCE IMPROVEMENT IN AD HOC NETWORKS
Ad-hoc networks are a new wireless networking paradigm for mobile hosts. Ad hoc networks don’t require any fixed infrastructure such as base stations or mobile switching centers. Node mobility in an ad-hoc network causes...