Hiding Frequent Patterns in the Updated Database

Sensitive frequent pattern hiding is an important issue in privacy preserving data mining. In this era of information explosion and rapid development of the Internet, the data stored in the database is usually continuously updated. Existing frequent pattern hiding algorithms gradually become inadequate because those algorithms are originally designed for static database and thus they cannot handle incremental datasets effectively and efficiently. In order to solve this problem, we propose an incremental mechanism and design a data structure in this paper to hide sensitive frequent patterns in the incremental environment. In this mechanism, the transaction data and sensitive patterns are stored in two types of trees. The proposed algorithm can efficiently find related transactions by links between these two types of trees. Experiment results show that the proposed method can efficiently hide sensitive frequent patterns in the incremental environment.

[1]  Chris Clifton,et al.  Using unknowns to prevent discovery of association rules , 2001, SGMD.

[2]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[3]  Elisa Bertino,et al.  State-of-the-art in privacy preserving data mining , 2004, SGMD.

[4]  Tzung-Pei Hong,et al.  Efficient sanitization of informative association rules , 2008, Expert Syst. Appl..

[5]  Raj P. Gopalan,et al.  CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth , 2003, ADC.

[6]  Shyue-Liang Wang.  Maintenance of sanitizing informative association rules , 2009, Expert Syst. Appl..

[7]  Shan-Tai Chen,et al.  A Novel Algorithm for Completely Hiding Sensitive Association Rules , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[8]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[9]  Bi-Ru Dai,et al.  Hiding Frequent Patterns under Multiple Sensitive Thresholds , 2008, DEXA.

[10]  Stanley Robson de Medeiros Oliveira,et al.  Privacy preserving frequent itemset mining , 2002 .

[11]  Elisa Bertino,et al.  Association rule hiding , 2004, IEEE Transactions on Knowledge and Data Engineering.

[12]  Shyue-Liang Wang,et al.  Hiding informative association rule sets , 2007, Expert Syst. Appl..

[13]  Chris Clifton,et al.  SECURITY AND PRIVACY IMPLICATIONS OF DATA MINING , 1996 .

[14]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[15]  Philip S. Yu,et al.  Template-based privacy preservation in classification problems , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[16]  Maria E. Orlowska,et al.  A new framework of privacy preserving data sharing , 2004 .