SCIENCE CHINA Information Sciences, Volume 63 , Issue 5 : 159101(2020) https://doi.org/10.1007/s11432-018-9849-y

An effective scheme for top-$k$ frequent itemset mining under differential privacy conditions

More info
  • ReceivedDec 10, 2018
  • AcceptedMar 6, 2019
  • PublishedMar 26, 2020


There is no abstract available for this article.


This work was supported by National Natural Science Foundation of China (Grant Nos. 61- 532021, 61772537, 61772536, 61702522) and National Key RD Program of China (Grant No. 2018YFB1004400).


Appendixes A–F.


[1] Garofalakis M, Gehrke J, Rastogi R. Querying and mining data streams: you only get one look a tutorial. In: Proceedings of ACM SIGMOD International Conference, Madison, 2002. Google Scholar

[2] Zeng C, Naughton J F, Cai J Y. On differentially private frequent itemset mining. Proc VLDB Endow, 2012, 6: 25-36 CrossRef Google Scholar

[3] Su S, Xu S Z, Cheng X, et al. Differentially private frequent itemset mining via transaction splitting. In: Proceedings of the 32nd IEEE International Conference on Data Engineering, Helsinki, 2016. 1564--1565. Google Scholar

[4] Wang N, Xiao X K, Yang Y, et al. PrivSuper: a superset-first approach to frequent itemset mining under differential privacy. In: Proceedings of the 33nd IEEE International Conference on Data Engineering, San Diego, 2017. 809--820. Google Scholar

[5] Dwork C, Mcsherry F, Nissim K, et al. Calibrating noise to sensitivity in private data analysis. In: Proceedings of Theory of Cryptography Conference, New York, 2006. 265--284. Google Scholar

[6] McSherry F, Talwar K. Mechanism design via differential privacy. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, 2007. 94--103. Google Scholar

[7] Efraimidis P S, Spirakis P G. Weighted random sampling with a reservoir. Inf Processing Lett, 2006, 97: 181-185 CrossRef Google Scholar