On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining
Additive Randomization has been a primary tool to hide sensitive private information during privacy preserving data mining. The previous work based on Spectral Filtering empirically showed that individual data can be separated from the perturbed one and as a result privacy can be seriously compromis...
Saved in:
Main Authors: | GUO, Songtao, Wu, Xintao, LI, Yingjiu |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/322 http://dx.doi.org/10.1007/11871637_51 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Determining Error Bounds for Spectral Filtering Based Reconstruction Methods in Privacy Preserving Data Mining
by: GUO, Songtao, et al.
Published: (2008) -
Preserving Privacy in Association Rule Mining with Bloom Filters
by: QIU, Ling, et al.
Published: (2007) -
Protecting business intelligence and customer privacy while outsourcing data mining tasks
by: QIU, Ling, et al.
Published: (2008) -
An Approach to Outsourcing Data Mining Tasks While Protecting Business Intelligence and Customer Privacy
by: QU, Ling, et al.
Published: (2006) -
A Close Look at Privacy Preserving Data Mining Methods
by: WU, Xindong, et al.
Published: (2006)