Abstract
Large repositories of data contain sensitive information which must be protected against unauthorized access. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, which are called association rules. If the disclosure risk of some of these rules are above a certain privacy threshold, those rules must be characterized as sensitive. Sometimes, sensitive rules should not be disclosed to the public since, among other things, they may be used for inferencing sensitive data, or they may provide business competitors with an advantage.
Portions of this work were supported by sponsors of the Center for Education and Research in Information Assurance and Security.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Mannila, H., Srinkant, R., Toivonen, H., Verkamo, A. I.: Fast Discovery of Association Rules. In: Fayyad, U., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press (1996) 307–328
Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: From Data Mining to Knowledge Discovery: An Overview. In: Fayyad, U., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press (1996) 1–34
Moskowitz, I. S., Chang, L. A.: An Entropy-Based Framework for Database Inference. In: Proceedings of the Information Hiding Workshop, Dresden, Germany. Springer-Verlag, LCNS 1768 (2000) 405–418
O’Leary, D. E.: Knowledge Discovery as a Threat to Database Security. In: Piatetsky-Shapiro, G., and Frawley, W. J. (eds): Knowledge Discovery in Databases. AAAI Press/MIT Press, Menlo Park, CA (1991) 507–516
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of the ACM-SIGMOD Conference on Management of Data. Washington, DC (1993) 207–216
Agrawal, R., Srikant, R.: Fast Algorithm for Mining Association Rules. In: Bocca, J., Jarke, M., Zaniolo, C. (eds.): Proceedings of the Twentieth International Conference on Very Large Data Bases (VLDB 94). Santiago, Chile (1994) 487–499
Clifton, C., Marks, D.: Security and Privacy Implication of Data Mining. In: Proceedings of the 1996 ACM Workshop on Data Mining and Knowledge Discovery (1996)
Clifton, C.: Protecting against Data Mining through Samples. In: Proceedings of the 13th IFIP WG11.3 Conference on Database Security. Seattle, Washington (1999)
Johnsten. T., Raghavan, V.: Impact of Decision-Region Based Classification Mining Algorithms on Database Security. In: Proceedings of the 13th IFIP WG11.3 Conference on Database Security. Seattle, Washington (1999)
Atallah, M., Bertino, E., Elmagarmid, A. K., Ibrahim, M., Verykios, V. S.: Disclosure Limitation Of Sensitive Rules. In: 1999 IEEE Workshop on Knowledge and Data Engineering Exchange. Chicago, Illinois (1999) 45–52
Agrawal, R.: Data Mining: Crossing The Chasm. In: Proceedings of the 5th International Conference on Knowledge Discovery in Databases and Data Mining. San Diego, California August (1999)
Agrawal, R., Srikant, R.: Privacy-Preserving Data Mining. Technical Report, IBM Almaden Research Center, San Jose, California (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E. (2001). Hiding Association Rules by Using Confidence and Support. In: Moskowitz, I.S. (eds) Information Hiding. IH 2001. Lecture Notes in Computer Science, vol 2137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45496-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-45496-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42733-9
Online ISBN: 978-3-540-45496-0
eBook Packages: Springer Book Archive