On Privacy-Preservation of Text and Sparse Binary Data with Sketches
By Charu C. Aggarwal, Philip S. Yu. 2007
40 citations recorded by the source corpus.
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high dimensional, which are challenging to different privacy preservation algorithms. However, some domains of such data sets also have some special properties which make the use of sketch based techniques particularly useful. In this paper, we present a new method for privacy preserving data mining of text and binary data with the use of a sketch based approach. The special properties of such data sets which are exploited are that of sparsity; according to this property, only a small percentage of the attributes have non-zero values. We formalize an anonymity model for the sketch based approach, and utilize it in order to construct sketch based privacy preserving representations of the original data. This representation allows accurate computation of a number of important data mining primitives such as the dot product. Therefore, it can be used for a variety of data mining algorithms such as clustering and classification. We illustrate the effectiveness of our approach on a number of real and synthetic data sets. We show that the accuracy of data mining algorithms is preserved by the transformation even in the presence of increasing data dimensionality.
Subfields: Artificial Intelligence
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Philip S. Yu
- Charu C. Aggarwal
- Ling Liu
- Keke Chen
- Aleksandra Korolova
- Ú. Erlingsson
- Vasyl Pihur
- Ninghui Li
Citations in the corpus
- RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response (2014, background): “Usage of various dimensionality reduction techniques in order to improve the privacy properties of algorithms while retaining utility is also fairly common [20, 17, 1, 22].”
- A Survey of Multiplicative Perturbation for Privacy-Preserving Data Mining (2008, background): “This typical tradeoff has to be carefully controlled in practice [2].”
- A General Survey of Privacy-Preserving Data Mining Models and Algorithms (2008, background): “Another approach discussed in [11] constructs synthetic data which preserves the aggregate characteristics of the original data, but preserves the privacy of the original records.”