An Improved Algorithm for Completely Hiding Sensitive Association Rule Sets

Association analysis is a powerful technology for discovering hidden information in huge databases. Nowadays, strategic alliances often share their information for exploring more useful decision-making information and for enhancing their core competitiveness. However, information sharing will potentially involve threats that privacy or sensitive information could be unconsciously divulged. In this study, we propose a novel algorithm, ADSSI, for privacy preservation against association rule analysis. Through entirely analyzing all types of frequent items, ADSSI reduces the risk of sensitive information leakage by slightly modifying transactions in a database. ADSSI is able to completely hide all sensitive association rule sets while no new rules generated in the shared database. Moreover, compared to the current-best works, experimental results show that ADSSI outperforms other published algorithms in terms of side effects generated.

[1]  Tzung-Pei Hong,et al.  Efficient sanitization of informative association rules , 2008, Expert Syst. Appl..

[2]  S. Srinivasa Rao,et al.  Privacy Preserving in Clustering using Fuzzy Sets , 2006, DMIN.

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

[4]  Ali Amiri,et al.  Dare to share: Protecting sensitive knowledge with data sanitization , 2007, Decis. Support Syst..

[5]  So Young Sohn,et al.  Searching customer patterns of mobile service using clustering and quantitative association rule , 2008, Expert Syst. Appl..

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

[7]  Shan-Tai Chen,et al.  A Novel Algorithm for Hiding Sensitive Frequent Itemsets , 2007 .

[8]  Tzung-Pei Hong,et al.  Efficient Sanitization of Informative Association Rules with Updates , 2006, 2006 International Conference on Information and Automation.

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

[10]  Richard Weber,et al.  A methodology for web usage mining and its application to target group identification , 2004, Fuzzy Sets Syst..

[11]  Osmar R. Zaïane,et al.  A privacy-preserving clustering approach toward secure and effective data analysis for business collaboration , 2007, Comput. Secur..

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

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

[14]  Arbee L. P. Chen,et al.  Hiding Sensitive Association Rules with Limited Side Effects , 2007, IEEE Transactions on Knowledge and Data Engineering.