Maintaining privacy and data quality in privacy preserving association rule mining

Privacy preserving data mining (PPDM) is a novel research direction to preserve privacy for sensitive knowledge from disclosure. Many of the researchers in this area have recently made effort to preserve privacy for sensitive association rules in statistical database. In this paper, we propose a heuristic algorithm named DSRRC (Decrease Support of R.H.S. item of Rule Clusters), which provides privacy for sensitive rules at certain level while ensuring data quality. Proposed algorithm clusters the sensitive association rules based on certain criteria and hides as many as possible rules at a time by modifying fewer transactions. Because of less modification in database it helps maintaining data quality.

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

[2]  Hui Wang,et al.  Research on the Privacy Preserving Algorithm of Association Rule Mining in Centralized Database , 2008, 2008 International Symposiums on Information Processing.

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

[4]  K. Duraiswamy,et al.  Advanced Approach in Sensitive Rule Hiding , 2009 .

[5]  Heikki Mannila,et al.  Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.

[6]  Alberto Trombetta,et al.  Information driven association rule hiding algorithms , 2008, 2008 1st International Conference on Information Technology.

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

[8]  Yücel Saygin,et al.  Secure Association Rule Sharing , 2004, PAKDD.

[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]  Arbee L. P. Chen,et al.  Hiding Sensitive Association Rules with Limited Side Effects , 2007 .

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

[12]  Taneli Mielikäinen,et al.  On Inverse Frequent Set Mining , 2003 .

[13]  Shyue-Liang Wang,et al.  Using unknowns for hiding sensitive predictive association rules , 2005, IRI -2005 IEEE International Conference on Information Reuse and Integration, Conf, 2005..

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

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

[16]  Philip S. Yu,et al.  Privacy-Preserving Data Mining - Models and Algorithms , 2008, Advances in Database Systems.

[17]  Hui Yang,et al.  Data Mining: Concepts and Techniques , 2008 .

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

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

[20]  Gu Si-yang,et al.  Privacy preserving association rule mining in vertically partitioned data , 2006 .

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