Privacy Preserving Informative Association Rule Mining

Privacy preserving data mining has two major directions: one is the protection of private data, i.e., data hiding in the database whereas another one is the protection of sensitive rule (Knowledge) contained in data known as knowledge hiding in the database. This research work focuses on protection of sensitive association rule. Corporation individual & other may get mutual benefit by sharing their data, but at the same time, they would like to be sure that their sensitive data remains private or not disclosed, i.e., hiding sensitive association rules. Approaches need to be given sensitive association rule in advance to hide them, i.e., mining is repaired. However, for some application pre-process of these sensitive association rules is combined with hiding process when predictive items are given, i.e., hiding informative association rule set. In this work, we propose two algorithms ISLFASTPREDICTIVE, DSRFASTPREDICTIVE to hide informative association rule with n-items. Earlier work hided 2-item association rules. Algorithms proposed in the paper execute faster than ISL & DSR algorithms prepared earlier as well as a side effect have been reduced. ISLFASTPREDICTIVE and DSRFASTPREDICTIVE algorithms work better as database scans are reduced since transaction list of elements is used in algorithms, i.e., a list of the transaction which supports itemsets and selection of transactions are done on the basis of presence of frequent itemsets.

[1]  Ramakrishnan Srikant,et al.  Privacy preserving OLAP , 2005, SIGMOD '05.

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

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

[4]  Brijesh Kumar Chaurasia,et al.  Hiding Sensitive Association Rules without Altering the Support of Sensitive Item(s) , 2012 .

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

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

[7]  Nabil R. Adam,et al.  Security-control methods for statistical databases: a comparative study , 1989, ACM Comput. Surv..

[8]  Kurt Hornik,et al.  The arules R-Package Ecosystem: Analyzing Interesting Patterns from Large Transaction Data Sets , 2011, J. Mach. Learn. Res..

[9]  Chris Clifton,et al.  Privacy-preserving distributed mining of association rules on horizontally partitioned data , 2004, IEEE Transactions on Knowledge and Data Engineering.

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

[11]  Cheng Zheng,et al.  An incremental updating technique for mining indirect association rules , 2008, 2008 International Conference on Machine Learning and Cybernetics.

[12]  Kurt Hornik,et al.  Introduction to arules – A computational environment for mining association rules and frequent item sets , 2009 .

[13]  Peter Dalgaard,et al.  R Development Core Team (2010): R: A language and environment for statistical computing , 2010 .

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

[15]  Michael J. Shaw,et al.  Supply-Chain Partnership between P&G and Wal-Mart , 2002 .

[16]  Tzung-Pei Hong,et al.  Multi-table association rules hiding , 2010, 2010 10th International Conference on Intelligent Systems Design and Applications.

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

[18]  N. S. Chaudhari,et al.  Privacy preserving association rule mining by introducing concept of impact factor , 2012, 2012 7th IEEE Conference on Industrial Electronics and Applications (ICIEA).

[19]  Xiaoming Zhang.  Knowledge Hiding in Data Mining by Transaction Adding and Removing , 2007, 31st Annual International Computer Software and Applications Conference (COMPSAC 2007).

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

[21]  Sotirios G. Ziavras,et al.  A super-programming approach for mining association rules in parallel on PC clusters , 2004, IEEE Transactions on Parallel and Distributed Systems.

[22]  Philip S. Yu,et al.  On Privacy-Preservation of Text and Sparse Binary Data with Sketches , 2007, SDM.

[23]  Qiang Ding,et al.  PARM—An Efficient Algorithm to Mine Association Rules From Spatial Data , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Charu C. Aggarwal,et al.  On the design and quantification of privacy preserving data mining algorithms , 2001, PODS.

[25]  Christos Faloutsos,et al.  Auditing Compliance with a Hippocratic Database , 2004, VLDB.

[26]  Yuhong Guo.  Reconstruction-Based Association Rule Hiding , 2007 .

[27]  Charu C. Aggarwal,et al.  On k-Anonymity and the Curse of Dimensionality , 2005, VLDB.

[28]  Yongge Wang,et al.  Approximate inverse frequent itemset mining: privacy, complexity, and approximation , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[29]  Vassilios S. Verykios,et al.  An Experimental Study of Distortion-Based Techniques for Association Rule Hiding , 2004, DBSec.

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

[31]  Jian Chen,et al.  Adapting the Right Measures for Pattern Discovery: A Unified View. , 2012, IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society.

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

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

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

[35]  Ashwin Machanavajjhala,et al.  l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.

[36]  Shiwei Tang,et al.  A FP-Tree-Based Method for Inverse Frequent Set Mining , 2006, BNCOD.

[37]  Guanling Lee,et al.  A novel method for protecting sensitive knowledge in association rules mining , 2005, 29th Annual International Computer Software and Applications Conference (COMPSAC'05).

[38]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[39]  Vassilios S. Verykios.  Association rule hiding methods , 2009, Encyclopedia of Data Warehousing and Mining.

[40]  Aruna Tiwari,et al.  A reduction of 3-Sat problem from optimal sanitization in association rule hiding , 2011, 2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC).