Hybrid Algorithm for Privacy Preserving Association Rule Mining

Problem statement: The objective of the hybrid algorithm for privacy preserving data mining is to hide certain sensitive information so that they cannot be discovered through association rule mining techniques. Approach: The sensitive items whether in Left Hand Side (LHS) or Right Hand Side (RHS) of the rule cannot be inferred through association rule mining algorithms by combining the concept of Increase Support of Left Hand Side (ISL) and Decrease Support of Right Hand Side (DSR) algorithms i.e., by increasing and decreasing the support of the LHS and RHS item of the rule respectively. Results: The efficiency of the proposed approach is compared with alone Increase Support of Left Hand Side (ISL) approach for real databases on the basis of number of rules pruned. Conclusion: The hybrid approach of ISL and DSR algorithms prunes more number of sensitive rules with same number of database scans.

[1]  Jaideep Vaidya,et al.  Knowledge and Information Systems , 2007 .

[2]  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.

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

[4]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2002, Journal of Cryptology.

[5]  Shyue-Liang Wang,et al.  Hiding sensitive predictive association rules , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[6]  E. Poovammal,et al.  Utility Independent Privacy Preserving Data Mining on Vertically Partitioned Data , 2009 .

[7]  Shyue-Liang Wang,et al.  Hiding sensitive items in privacy preserving association rule mining , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[8]  Alexandre V. Evfimievski,et al.  Privacy preserving mining of association rules , 2002, Inf. Syst..

[9]  Ahmad Mahir Razali,et al.  Generating Treatment Plan in Medicine: A Data Mining Approach , 2009 .

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

[11]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[12]  Sheng Zhong,et al.  Privacy-Preserving Classification of Customer Data without Loss of Accuracy , 2005, SDM.

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

[14]  Daniel A. Keim,et al.  Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , 2002, KDD.

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

[16]  Yücel Saygin,et al.  Privacy Preserving Clustering on Horizontally Partitioned Data , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[17]  Li Liu,et al.  The applicability of the perturbation based privacy preserving data mining for real-world data , 2008, Data Knowl. Eng..

[18]  Jaideep Vaidya,et al.  Privacy preserving association rule mining in vertically partitioned data , 2002, KDD.

[19]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2000, Journal of Cryptology.

[20]  Qi Wang,et al.  On the privacy preserving properties of random data perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[21]  Yücel Saygin,et al.  Privacy preserving clustering on horizontally partitioned data , 2007, Data Knowl. Eng..

[22]  Yücel Saygin,et al.  Privacy Preserving Spatio-Temporal Clustering on Horizontally Partitioned Data , 2006, DaWaK.