ACM Home Page
Please provide us with feedback. Feedback
Using unknowns to prevent discovery of association rules
Full text PdfPdf (971 KB)
Source ACM SIGMOD Record archive
Volume 30 ,  Issue 4  (December 2001) table of contents
SPECIAL ISSUE: Special section on data mining for intrusion detection and threat analysis table of contents
Pages: 45 - 54  
Year of Publication: 2001
ISSN:0163-5808
Authors
Yücel Saygin  Bilkent University, Turkey
Vassilios S. Verykios  Drexel University
Chris Clifton  Purdue University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 60,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/604264.604271
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
 
5
 
6
 
7
T. H. Hinke, H. S. Delugach, and R. P. Wolf. Protecting databases from inference attacks. Computers and Security, 16(8):687-708, 1997.
 
8
U. of California at Irvine Machine Learning Repository. http://www.ics.uci.edu/~mlearn/MLSummary.html.
 
9

CITED BY  29

Collaborative Colleagues:
Yücel Saygin: colleagues
Vassilios S. Verykios: colleagues
Chris Clifton: colleagues