Abstract
We present a generalization of a strategy, called SCIKD, proposed in [7] that allows to reduce a disclosure risk of confidential data in an information system S [10] using methods based on knowledge discovery. The method proposed in [7] protects confidential data against Rule-based Chase, the null value imputation algorithm driven by certain rules [2], [4]. This method identifies a minimal subset of additional data in S which needs to be hidden to guarantee that the confidential data are not revealed by Chase. In this paper we propose a bottom-up strategy which identifies, for each object x in S, a maximal set of values of attributes which do not have to be hidden and still the information associated with secure attribute values of x is protected. It is achieved without examining all possible combinations of values of attributes. Our method is driven by classification rules extracted from S and takes into consideration their confidence and support.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
UCI Machine Learning Rep., http://www.ics.uci.edu/~mlearn/MLRepository.html
Dardzińska, A., Raś, Z.W.: Rule-Based Chase Algorithm for Partially Incomplete Information Systems. In: Tsumoto, S., et al. (eds.) AM 2003. LNCS (LNAI), vol. 3430, pp. 42–51. Springer, Heidelberg (2005)
Dardzińska, A., Raś, Z.W.: On Rules Discovery from Incomplete Information Systems. In: Lin, T.Y., et al. (eds.) Proceedings of ICDM’03 Workshop on Foundations and New Directions of Data Mining, Melbourne, Florida, pp. 31–35. IEEE Computer Society Press, Los Alamitos (2003)
Dardzińska, A., Raś, Z.W.: Chasing Unknown Values in Incomplete Information Systems. In: Lin, T.Y., et al. (eds.) Proceedings of ICDM’03 Workshop on Foundations and New Directions of Data Mining, Melbourne, Florida, pp. 24–30. IEEE Computer Society Press, Los Alamitos (2003)
Du, W., Atallah, M.J.: Secure Multi-party Computation Problems and their Applications: a review and open problems. In: New Security Paradigms Workshop (2001)
Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining (2002)
Im, S., Raś, Z.W., Dardzińska, A.: SCIKD: Safeguarding Classified Information from Knowledge Discovery. In: Foundations of Semantic Oriented Data and Web Mining, Proceedings of 2005 IEEE ICDM Workshop, Houston, Texas, pp. 34–39. Math. Dept., Saint Mary’s Univ., Nova Scotia, Canada (2005)
Kantarcioglou, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. In: Proceedings of the ACM SIGMOD Workshop on Research Isuues in Data Mining and Knowledge Discovery, pp. 24–31 (2002)
Oliveira, S.R.M., Zaiane, O.R.: Privacy preserving frequent itemset mining. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining, pp. 43–54 (2002)
Pawlak, Z.: Information Systems - theoretical foundations. Information Systems Journal 6, 205–218 (1991)
Raś, Z.W., Dardzińska, A.: Solving Failing Queries through Cooperation and Collaboration. World Wide Web Journal (Special Issue on Web Resources Access) 9(2), 173–186 (2006)
Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162–167 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raś, Z.W., Gürdal, O., Im, S., Tzacheva, A. (2007). Data Confidentiality Versus Chase. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-72530-5_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72529-9
Online ISBN: 978-3-540-72530-5
eBook Packages: Computer ScienceComputer Science (R0)