Privacy Preservation: Chi Square Computation for Association Rule Mining

The big trouble of privacy preservation in data mining techniques has been studied comprehensively in current passing years because of the improved amount of private information which are presents locally and globally in the distributed database environments. The high amount of privacy preservation transformations use some form of data perturbation or representational ambiguity in order to reduce the risk of identification and security as well as privacy. In this paper, we propose an algorithm that is applicable all partitioned database may be horizontal, vertical and hybrid partitioning. The proposed algorithm provides the highest privacy preservation to the all database, because we used the data modification concept with the help of Chi Square concept and after that we used the privacy preservation algorithm to provide the privacy to the distributed homogeneous database by selecting the random number by all parties, then calculate the global support by using the algorithm that mentioned in the paper, with high privacy and zero percentage of data leakage.

[1]  Pingshui Wang.  Research on privacy preserving association rule mining a survey , 2010, 2010 2nd IEEE International Conference on Information Management and Engineering.

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

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

[4]  Ulrich Güntzer,et al.  Algorithms for association rule mining — a general survey and comparison , 2000, SKDD.

[5]  Chris Clifton,et al.  Tools for privacy preserving distributed data mining , 2002, SKDD.

[6]  Padhraic Smyth,et al.  Knowledge Discovery and Data Mining: Towards a Unifying Framework , 1996, KDD.

[7]  L. Ragha,et al.  Privacy Preserving in Data Mining Using Hybrid Approach , 2012, 2012 Fourth International Conference on Computational Intelligence and Communication Networks.

[8]  Edith Cohen,et al.  Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[9]  Joshua Zhexue Huang,et al.  Rating: Privacy Preservation for Multiple Attributes with Different Sensitivity Requirements , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[10]  Shafi Goldwasser,et al.  Multi party computations: past and present , 1997, PODC '97.

[11]  Philip S. Yu,et al.  A Condensation Approach to Privacy Preserving Data Mining , 2004, EDBT.

[12]  E. G. Komishani,et al.  A generalization-based approach for personalized privacy preservation in trajectory data publishing , 2012, 6th International Symposium on Telecommunications (IST).

[13]  Masaru Kitsuregawa,et al.  Hash based parallel algorithms for mining association rules , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[14]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

[15]  C. V. Guru Rao,et al.  Data perturbation and feature selection in preserving privacy , 2012, 2012 Ninth International Conference on Wireless and Optical Communications Networks (WOCN).

[16]  Martin Beck,et al.  Privacy-preserving data mining demonstrator , 2012, 2012 16th International Conference on Intelligence in Next Generation Networks.

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

[18]  J. Jesu Vedha Nayahi,et al.  A hybrid data anonymization integrated with suppression for preserving privacy in mining multi party data , 2011, 2011 International Conference on Recent Trends in Information Technology (ICRTIT).

[19]  Reena Kharat,et al.  Privacy preserving mining of Association Rules on horizontally and vertically partitioned data: A review paper , 2012, 2012 12th International Conference on Hybrid Intelligent Systems (HIS).

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

[21]  Salvatore J. Stolfo,et al.  An extensible meta-learning approach for scalable and accurate inductive learning , 1996 .

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

[23]  D. Karthikeswaran,et al.  A pattern based framework for privacy preservation through association rule mining , 2012, IEEE-International Conference On Advances In Engineering, Science And Management (ICAESM -2012).

[24]  Aleksandra B. Slavkovic,et al.  "Secure" Logistic Regression of Horizontally and Vertically Partitioned Distributed Databases , 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).

[25]  Wynne Hsu,et al.  Pruning and summarizing the discovered associations , 1999, KDD '99.

[26]  Roberto J. Bayardo,et al.  Mining the most interesting rules , 1999, KDD '99.

[27]  Geoffrey I. Webb.  Efficient search for association rules , 2000, KDD '00.

[28]  Victor J. Rayward-Smith,et al.  Non-linear Dimensionality Reduction for Privacy-Preserving Data Classification , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[29]  Rajeev Motwani,et al.  Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.