Top-k Frequent Itemsets via Differentially Private FP-trees thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Top-k Frequent Itemsets via Differentially Private FP-trees

Published on Oct 07, 20142072 Views

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 priva

Related categories

Chapter list

Top-K frequent itemsets via differentially private PP-trees00:00
Freequent Itemsets00:12
Our method02:18
Intuition03:34
Noisycut06:01
Privacity Analysis07:00
Proof Sketch07:54
FP-Tree09:57
Support Derivation - 112:36
Support Derivation - 113:20
Consistency14:06
Experiments - 114:50
Experiments - 215:44
Experiments - 316:17
Conclusion16:51