Locally Differentially Private Frequent Itemset Mining

By Tianhao Wang, Ninghui Li, Somesh Jha. 2018

198 citations recorded by the source corpus.

The notion of Local Differential Privacy (LDP) enables users to respond to sensitive questions while preserving their privacy. The basic LDP frequent oracle (FO) protocol enables an aggregator to estimate the frequency of any value. But when each user has a set of values, one needs an additional padding and sampling step to find the frequent values and estimate their frequencies. In this paper, we formally define such padding and sample based frequency oracles (PSFO). We further identify the privacy amplification property in PSFO. As a result, we propose SVIM, a protocol for finding frequent items in the set-valued LDP setting. Experiments show that under the same privacy guarantee and computational cost, SVIM significantly improves over existing methods. With SVIM to find frequent items, we propose SVSM to effectively find frequent itemsets, which to our knowledge has not been done before in the LDP setting.

Subfields: Artificial Intelligence, Information Systems

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

  1. Ninghui Li
  2. Tianhao Wang
  3. Somesh Jha
  4. Graham Cormode
  5. Jun Zhao
  6. Divesh Srivastava
  7. Xiaokui Xiao
  8. Bolin Ding

In Information Systems

  1. Tianhao Wang
  2. Ninghui Li
  3. Somesh Jha
  4. Divesh Srivastava
  5. Jun Zhao
  6. Siu Cheung Hui
  7. Bolin Ding
  8. Graham Cormode

Citations in the corpus