This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Privacy Preserving Association Rules by Using Greedy Approach
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Data mining techniques have been developed in many applications. However, they also cause a threat to privacy. In this paper, we proposed a greedy method for hiding the number of sensitive rules. The experimental results showed that the undesired side effects can be avoided in the rule hiding process by use of our approach. The results also revealed that in most cases, all the sensitive rules are hidden without generating spurious rules. First, the good scalability of our approach in terms of database sizes is achieved by using an efficient data structure FCET to store solely maximal frequent itemsets rather than the entire frequent itemsets. Furthermore, we proposed a new framework for enforcing the privacy in mining association rules, that combine the techniques for efficiently hiding sensitive rules and the transaction retrieval engine based on the FCET index tree. In particular, four strategies are implemented in the sanitized procedure, for hiding a group of association rules characterized as sensitive or artificial rules.
Index Terms:
Greedy methods, FCET, maximal frequent itemsets, sanitized procedure, rule hiding
Citation:
Chieh-Ming Wu, Yin-Fu Huang, Jian-Ying Chen, "Privacy Preserving Association Rules by Using Greedy Approach," csie, vol. 4, pp.61-65, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.