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 116
- Downloads 0
Fractals Based Clustering for CBIR
Fractal based CBIR is based on the self similarity fundamentals of fractals. Mathematical and natural fractals are the shapes whose roughness and fragmentation neither tend to vanish, nor fluctuate, but remain essentiall...
New Design Metrics for Complexity Estimation in Object Oriented Systems
This paper proposes four design metrics of class level for early and effective feedback to manage the quality of object-oriented software. These metrics measure the complexity induced by the use of various object-oriente...
Prediction of Association among Numerical Aptitude, Programming Skills, Trait Emotional Intelligence on Students Performance
Identifying variables that predict programming skill may help educators and employers. The employer may select potential students as employees. These variables are influenced by various factors. This paper is an attempt...
Information and Communication Technology (ICT) Revolution: Its Environmental Impact and Sustainable Development
Our world’s resources, and even the planet itself, are rapidly decaying faster than we can imagine. While many people debate the causes the effects are obvious to all: climate change, problem in the animal world, health...
Rebroadcasting for Routing Reduction based upon Neighbor coverage in Ad Hoc Networks
Cause of nodes high mobility in mobile ad hoc networks (MANETs), there are frequent link breakages exist which escort to frequent route discoveries and path failures. The route discovery procedure cannot be ignored. In a...