Abstract
Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However efficiency is not our only concern in this study. The security and privacy issues over the extracted knowledge must be seriously considered as well. By taking this into consideration, we study the discovery of association rules in binary data sets and we propose algorithms for selectively hiding sensitive association rules. Association rule hiding is a well researched area in privacy preserving data mining and many algorithms have been proposed to address it. The algorithms that we introduce use a distortion-based technique for hiding the sensitive rules. The hiding process may introduce a number of side effects either by generating rules which were not previously existing (ghost rules) or by eliminating existing non-sensitive rules (lost rules). The proposed algorithms use effective data structures for the representation of the association rules and they strongly rely on the prioritization of the selection of the transactions to choose for falsification (victim transactions) by using weights. In this paper we show that our algorithms perform better than other similar algorithms in this field in eliminating non-sensitive rules without increasing the processing time significantly.
This work has been supported by European Commission under the PANDA and CODM1NE IST/FET Projects.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Yucel Saygin, Vassilios Verykios, and Chris Clifton, Using Unknowns to Prevent Discovery of Association Rules, SIGMOD Record 30 (2001), no. 4, 45–54.
Stanley R. M. Oliveira and Osmar R. Zaiane, Privacy Preserving frequent Itemset Mining, In Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining (2002), 43–54.
Vassilios S. Verykios, Ahmed K. Elmagarmid, Bertino Elisa, Yucel Saygin, and Dasseni Elena, Association Rule Hiding, IEEE Transactions on Knowledge and Data Engineering (2003).
Mike J. Atallah, Elisa Bertino, Ahmed K. Elmagarmid, Mohamed Ibrahim, and Vassilios S. Verykios, Disclosure Limitation of Sensitive Rules, In Proceedings of the IEEE Knowledge and Data Engineering Workshop (1999), 45–52.
Elena Dasseni, Vassilios S. Verykios, Ahmed K. Elmagarmid, and Elisa Bertino, Hiding Association Rules by using Confidence and Support, In Proceedings of the 4th Information Hiding Workshop (2001), 369–383.
Yucel Saygin, Vassilios S. Verykios, and Ahmed K. Elmagarmid, Privacy Preserving Association Rule Mining, In Proceedings of the 12 th International Workshop on Research Issues in Data Engineering (2002), 151–158.
Johnsten, T., Raghavan, V., Hill K., 2002. The Security Assessment of Association Mining Algorithms in “Proceedings of the Sixteenth Annual IFIP WG 11.3 Working Conference on Database Applications Security.
Vassilios S. Verykios, Elisa Bertino, Igor Nai Fovino, Loredana Parasiliti Provenza, Yucel Saygin, Yannis Theodoridis, State of the Art in Privacy Preserving Data Mining. To appear in SIGMOD Record 2003.
Alexandre Evfimievski, Ramakrishnan Srikant, Rakesh Agrawal, Johannes Gehrke. Privacy Preserving Mining of Association Rules. SIGKDD 2002, Edmonton, Alberta Canada.
Murat Kantarcioglou and Chris Clifton, Privacy Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data, In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2002), 24–31.
Jaideep Vaidya and Chris Clifton, Privacy Preserving Association Rule Mining in Vertically Partitioned Data, In the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002), 639–644.
R. Agrawal and R. Srikant. Privacy-Preserving Data Mining. In Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, Dallas, TX, May 14–19 2000. ACM.
C. Clifton and D. Marks. Security and Privacy Implications of Data Mining. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 15–19, May 1996.
Y. Lindell and B. Pinkas. Privacy Preserving Data Mining. Lecture Notes in Computer Science, 2000.
LiWu Chang and Ira S. Moskowitz, Parsimonious Downgrading and Decision Trees Applied to the Inference Problem, In Proceedings of the 1998 New Security Paradigms Workshop (1998), 82–89.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Pontikakis, E.D., Tsitsonis, A.A., Verykios, V.S. (2004). An Experimental Study of Distortion-Based Techniques for Association Rule Hiding. In: Farkas, C., Samarati, P. (eds) Research Directions in Data and Applications Security XVIII. IFIP International Federation for Information Processing, vol 144. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8128-6_22
Download citation
DOI: https://doi.org/10.1007/1-4020-8128-6_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8127-9
Online ISBN: 978-1-4020-8128-6
eBook Packages: Springer Book Archive