The discovery of frequent itemsets can serve valuable economic and research purposes. Releasing discovered frequent itemsets, however, presents privacy challenges. In this paper, we study the problem of how to perform frequent itemset mining on transaction databases while satisfying differential privacy. We propose an approach, called PrivBasis, which leverages a novel notion called basis sets. A θ-basis set has the property that any itemset with frequency higher than θ is a subset of some basis. We introduce algorithms for privately constructing a basis set and then using it to find the most frequent itemsets. Experiments show that our approach greatly outperforms the current state of the art.
Li et al. presented an algorithm called PrivBasis that can find the most frequent itemsets with differential privacy REF .
PrivBasis: Frequent Itemset Mining with Differential Privacy
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp. 1340-1351 (2012)
Computer Science