Association rule hiding using cuckoo optimization algorithm

We use Cuckoo Optimization Algorithm for hiding sensitive association rules.A preprocess is defined that causes speedy access to the optimal solution.Introducing three fitness functions with minimum side effects.An immigration algorithm is defined to escape from local optimums.For efficiency assessment, the algorithm is examined on real and synthetic data. Privacy preserving data mining is a new research field that aims to protect the private information and avoid the leakage of this information during the data mining process. One of the techniques in this field is the Privacy Preserving Association Rule Mining which aims to hide sensitive association rules. Many different algorithms with particular approaches have so far been developed to reach this purpose. In this paper, a new and efficient approach has been introduced which benefits from the cuckoo optimization algorithm for the sensitive association rules hiding (COA4ARH). In this method the act of hiding is performed using the distortion technique. Further in this study three fitness functions are defined which makes it possible to achieve a solution with the fewest side effects. Introducing an efficient immigration function in this approach has improved its ability to escape from any local optimum. The efficiency of proposed approach was evaluated by conducting some experiments on different databases. The results of the execution of the proposed algorithm and three of the previous algorithms on different databases indicate that this algorithm has superior performance compared to other algorithms.

[1]  Aris Gkoulalas-Divanis,et al.  Hiding sensitive knowledge without side effects , 2009, Knowledge and Information Systems.

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

[3]  Osmar R. Zaïane,et al.  A unified framework for protecting sensitive association rules in business collaboration , 2006, Int. J. Bus. Intell. Data Min..

[4]  Kenneth Morgan,et al.  Modified cuckoo search: A new gradient free optimisation algorithm , 2011 .

[5]  George V. Moustakides,et al.  A Max-Min Approach for Hiding Frequent Itemsets , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[6]  Sumit Sarkar,et al.  Maximizing Accuracy of Shared Databases when Concealing Sensitive Patterns , 2005, Inf. Syst. Res..

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

[8]  Sumit Sarkar,et al.  Minimizing Information Loss and Preserving Privacy , 2007, Manag. Sci..

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

[10]  Ayyaz Hussain,et al.  Improved Genetic Algorithm Approach for Sensitive Association Rules Hiding , 2014 .

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

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

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

[14]  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).

[15]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[16]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[17]  Yannis Theodoridis,et al.  Efficient algorithms for distortion and blocking techniques in association rule hiding , 2007, Distributed and Parallel Databases.

[18]  Yücel Saygin,et al.  Privacy preserving association rule mining , 2002, Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002.

[19]  Osmar R. Zaïane,et al.  Protecting sensitive knowledge by data sanitization , 2003, Third IEEE International Conference on Data Mining.

[20]  George V. Moustakides,et al.  A MaxMin approach for hiding frequent itemsets , 2008, Data Knowl. Eng..

[21]  Osmar R. Zaïane,et al.  Algorithms for balancing privacy and knowledge discovery in association rule mining , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

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

[23]  Ramin Rajabioun,et al.  Cuckoo Optimization Algorithm , 2011, Appl. Soft Comput..

[24]  Ahmad Khademzadeh,et al.  A Novel Method for Privacy Preserving in Association Rule Mining Based on Genetic Algorithms , 2009, J. Softw..

[25]  Xin-She Yang,et al.  Multiobjective cuckoo search for design optimization , 2013, Comput. Oper. Res..

[26]  Philip S. Yu,et al.  Hiding Sensitive Frequent Itemsets by a Border-Based Approach , 2007, J. Comput. Sci. Eng..

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

[28]  Aris Gkoulalas-Divanis,et al.  An integer programming approach for frequent itemset hiding , 2006, CIKM '06.