ACM Home Page
Please provide us with feedback. Feedback
On the use of spectral filtering for privacy preserving data mining
Full text PdfPdf (316 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2006 ACM symposium on Applied computing table of contents
Dijon, France
SESSION: Data mining (DM) table of contents
Pages: 622 - 626  
Year of Publication: 2006
ISBN:1-59593-108-2
Authors
Songtao Guo  University of North Carolina at Charlotte
Xintao Wu  University of North Carolina at Charlotte
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 58,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Randomization has been a primary tool to hide sensitive private information during privacy preserving data mining. The previous work based on spectral filtering, show the noise may be separated from the perturbed data under some conditions and as a result privacy can be seriously compromised. In this paper, we explicitly assess the effects of perturbation on the accuracy of the estimated value and give the explicit relation on how the estimation error varies with perturbation. In particular, we derive one upper bound for the Frobenius norm of reconstruction error. This upper bound may be exploited by attackers to determine how close their estimates are from the original data using spectral filtering technique, which imposes a serious threat of privacy breaches.