Use EMO to protect sensitive knowledge in association rule mining by removing items

When people utilize data mining techniques to discover useful knowledge behind large database, they also have the requirement to preserve some information so as not to be mined out, such as sensitive frequent item sets, rules, classification tree and the like. A feasible way to address this problem is to sanitize the database to conceal the sensitive information. In this paper, we focus on privacy preserving in association rule mining. In light of the tradeoff between hiding sensitive rules and disclosing non-sensitive ones during hiding process, we tackle this problem from a point view of multi-objective optimization. A novel association rule hiding approach was proposed based on evolutionary multi-objective optimization (EMO) algorithm. It adopted the model of hiding sensitive rules by deleting some items in database. Three side effects, including sensitive rules not hidden, non-sensitive lost rules and spurious rules were formulated as objectives to be minimized. The EMO algorithm was utilized to find a suitable subset of transactions to modify so that the three side effects can be minimized. Experiment results were reported to show the effectiveness of the proposed approach.

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

[2]  Arbee L. P. Chen,et al.  Hiding Sensitive Association Rules with Limited Side Effects , 2007 .

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

[4]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[5]  Ferenc Bodon,et al.  Surprising Results of Trie-based FIM Algorithms , 2004, FIMI.

[6]  Carla E. Brodley,et al.  KDD-Cup 2000 organizers' report: peeling the onion , 2000, SKDD.

[7]  Marco Laumanns,et al.  PISA: A Platform and Programming Language Independent Interface for Search Algorithms , 2003, EMO.

[8]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[9]  Ali Amiri,et al.  Dare to share: Protecting sensitive knowledge with data sanitization , 2007, Decis. Support Syst..

[10]  Elisa Bertino,et al.  Hiding Association Rules by Using Confidence and Support , 2001, Information Hiding.

[11]  K. Sathiyapriya,et al.  A Survey on Privacy Preserving Association Rule Mining , 2013 .

[12]  Roberto J. Bayardo,et al.  Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[13]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[14]  Aris Gkoulalas-Divanis,et al.  Exact Knowledge Hiding through Database Extension , 2009, IEEE Transactions on Knowledge and Data Engineering.

[15]  Gary B. Lamont,et al.  Evolutionary algorithms for solving multi-objective problems, Second Edition , 2007, Genetic and evolutionary computation series.

[16]  Philip S. Yu,et al.  A border-based approach for hiding sensitive frequent itemsets , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[17]  Vassilios S. Verykios,et al.  Disclosure limitation of sensitive rules , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[18]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..