Name
Abstract | ||
|---|---|---|
Frequent itemset mining is a core data mining task and has been studied extensively. Although by their nature, frequent itemsets are aggregates over many individuals and would not seem to pose a privacy threat, an attacker with strong background information can learn private individual information from frequent itemsets. This has lead to differentially private frequent itemset mining, which protects privacy by giving inexact answers. We give an approach that first identifies top-k frequent itemsets, then uses them to construct a compact, differentially private FP-tree. Once the noisy FP-tree is built, the (privatized) support of all frequent itemsets can be derived from it without access to the original data. Experimental results show that the proposed algorithm gives substantially better results than prior approaches, especially for high levels of privacy. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2623330.2623723 | KDD |
Keywords | Field | DocType |
differential privacy,fp-tree,frequent itemset,general | Data mining,Differential privacy,Computer science | Conference |
Citations | PageRank | References |
24 | 0.86 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaewoo Lee | 1 | 38 | 1.62 |
| Chris Clifton | 2 | 3327 | 544.44 |