|
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
|
|
|
|
|
|
|
|
|
|
|
Emmanuel D. Pontikakis , Yannis Theodoridis , Achilleas A. Tsitsonis , Liwu Chang , Vassilios S. Verykios, A quantitative and qualitative ANALYSIS of blocking in association rule hiding, Proceedings of the 2004 ACM workshop on Privacy in the electronic society, October 28-28, 2004, Washington DC, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|