Format

Send to

Choose Destination
IEEE Trans Knowl Data Eng. 2017 Mar 1;29(3):698-711. doi: 10.1109/TKDE.2016.2628180. Epub 2016 Nov 11.

Scalable Iterative Classification for Sanitizing Large-Scale Datasets.

Author information

1
Vanderbilt University.

Abstract

Cheap ubiquitous computing enables the collection of massive amounts of personal data in a wide variety of domains. Many organizations aim to share such data while obscuring features that could disclose personally identifiable information. Much of this data exhibits weak structure (e.g., text), such that machine learning approaches have been developed to detect and remove identifiers from it. While learning is never perfect, and relying on such approaches to sanitize data can leak sensitive information, a small risk is often acceptable. Our goal is to balance the value of published data and the risk of an adversary discovering leaked identifiers. We model data sanitization as a game between 1) a publisher who chooses a set of classifiers to apply to data and publishes only instances predicted as non-sensitive and 2) an attacker who combines machine learning and manual inspection to uncover leaked identifying information. We introduce a fast iterative greedy algorithm for the publisher that ensures a low utility for a resource-limited adversary. Moreover, using five text data sets we illustrate that our algorithm leaves virtually no automatically identifiable sensitive instances for a state-of-the-art learning algorithm, while sharing over 93% of the original data, and completes after at most 5 iterations.

KEYWORDS:

Privacy preserving; game theory; weak structured data sanitization

Supplemental Content

Full text links

Icon for PubMed Central
Loading ...
Support Center