Yücel Saygin
Chris Clifton
Abstract
Data mining technology has given us new capabilities to identify correlations in large data sets. This introduces risks when the data is to be made public, but the correlations are private. We introduce a method for selectively removing individual values from a database to prevent the discovery of a set of rules, while preserving the data for other applications. The efficacy and complexity of this method are discussed. We also present an experiment showing an example of this methodology.
- D. Agrawal and C. Aggarwal. On the Deisgn and Quantification of Privacy Preserving Data Mining Algorithms. Proceedings of PODS, pages 247-255, 2001. Google Scholar
Digital Library
- R. Agrawal and R. Srikant. Privacy Preserving Data Mining. Proceedings of SIGMOD Conference, pages 45-52, 2000. Google ScholarDigital Library
- M. J. Atallah, E. Bertino, A. K. Elmagarmid, M. Ibrahim, and V. S. Verykios. Disclosure Limitation of Sensitive Rules. Proceedings of IEEE Knolwedge and Data Engineering Workshop, pages 45-52, November 1999. Google ScholarDigital Library
- L. Chang and I. S. Moskowitz. Parsimonious Downgrading and Decision Trees Applied to the Inference Problem. Proceedings of the Workshop of New Security Paradigms, pages 82-89, 1999. Google ScholarDigital Library
- C. Clifton. Using Sample Size to Limit Exposure to Data Mining. Journal of Computer Security, 8(4), 2000. Google ScholarDigital Library
- D. Elena, V. S. Verykios, A. K. Elmagarmid, and E. Bertino. Hiding Association Rules by using Confidence and Support. To appear in the Proceedings of Information Hiding Workshop, 2001. Google ScholarDigital Library
- T. H. Hinke, H. S. Delugach, and R. P. Wolf. Protecting databases from inference attacks. Computers and Security, 16(8):687-708, 1997.Google ScholarDigital Library
- U. of California at Irvine Machine Learning Repository. http://www.ics.uci.edu/~mlearn/MLSummary.html.Google Scholar
- V. S. Verykios, A. K. Elmagarmid, B. Elisa, D. Elena, and Y. Saygin. Association Rule Hiding. IEEE Transactions on Knowledge and Data Engineering, 2000. Under review. Google ScholarDigital Library
Index Terms
- Using unknowns to prevent discovery of association rules
Recommendations
Mining Negatives Association Rules Using Constraints
Pattern discovery techniques, such as association rule discovery is one of the fundamental problem in data mining. Usually the task is limited to positive rules of the form X Y when X and Y are susbets of items. To enlarge the knowledge discovery from ...
Suppressing Data Sets to Prevent Discovery of Association Rules
ICDM '05: Proceedings of the Fifth IEEE International Conference on Data MiningEnterprises have been collecting data for many reasons including better customer relationship management, and high-level decision making. Public safety was another motivation for large-scale data collection efforts initiated by government agencies. ...
Maximal Association Rules: A Tool for Mining Associations in Text
We describe a new tool for mining association rules, which is of special value in text mining. The new tool, called maximal associations , is geared toward discovering associations that are frequently lost when using regular association rules. ...
Comments