Differentially private frequent subgraph mining

2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016

Volumn , Issue , 2016, Pages 229-240

  Xu, Shengzhi ^a   Su, Sen ^a   Xiong, Li ^b   Cheng, Xiang ^a   Xiao, Ke ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PRIVACY;

DATA UTILITIES; DIFFERENTIAL PRIVACIES; FREQUENT SUBGRAPH MINING; FREQUENT SUBGRAPHS; IDENTIFICATION APPROACH; PRIVACY ANALYSIS; REAL DATA SETS; SENSITIVE INFORMATIONS;

DATA MINING;

EID: 84980410137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2016.7498243     Document Type: Conference Paper

References (28)

1. C. Dwork. Differential privacy. In ICALP, 2006.
2. L. Sweeney. k-anonymity: A model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Base Syst, 2002.
3. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In ICDE, 2006.
4. E. Shen and T. Yu. Mining frequent graph patterns with differential privacy. In KDD, 2013.
5. F. McSherry and K. Talwar. Mechanism design via differential privacy. In FOCS, 2007.
6. N. Li, W. Qardaji, D. Su, and J. Cao. Privbasis: frequent itemset mining with differential privacy. In VLDB, pages 305-316, 2012.
7. C. Zeng, J. F. Naughton, and J-Y. Cai. On differentially private frequent itemset mining. In VLDB, 2012.
8. S. Xu, S. Su, X. Cheng, Z. Li, and L. Xiong. Differentially private frequent sequence mining via sampling-based candidate pruning. In ICDE, 2015.
9. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.
10. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, 1994.
11. S. Su, S. Xu, X. Cheng, Z. Li, and F. Yang. Differentially private frequent itemset mining via transaction splitting. TKDE, 2015.
12. V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev. Private analysis of graph structure. In VLDB, 2011.
13. S. Chen and S. Zhou. Recursive mechanism: towards node differential privacy and unrestricted joins. In SIGMOD, 2013.
14. D. Proserpio, S. Goldberg, and F. McSherry. Calibrating data to sensitivity in private data analysis: A platform for differentially-private analysis of weighted datasets. In VLDB, 2014.
15. J. Zhang, G. Cormode, C. Procopiuc, D. Srivastava, and X. Xiao. Private release of graph statistics using ladder functions. In SIGMOD, 2015.
16. R. Bhaskar, S. Laxman, A. Smith, and A. Thakurta. Discovering frequent patterns in sensitive data. In KDD, 2010.
17. X. Cheng, S. Su, S. Xu, and Z. Li. Dp-apriori: A differentially private frequent itemset mining algorithm based on transaction splitting. Computers & Security, 2015.
18. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, 2000.
19. H. Li, L. Xiong, and X. Jiang. Differentially private synthesization of multi-dimensional data using copula functions. In EDBT, 2014.
20. J. Lee and C. Clifton. Top-k frequent itemsets via differentially private fp-trees. In KDD, 2014.
21. Y. Chen and A. Machanavajjhala. On the privacy properties of variants on the sparse vector technique. CoRR, 2015.
22. L. Bonomi and L. Xiong. A two-phase algorithm for mining sequential patterns with differential privacy. In CIKM, 2013.
23. C. Xiang, S. Su, S. Xu, P. Tang, and Z. Li. Differentially private maximal frequent sequence mining. Computers & Security, 2015.
24. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. TKDE, 2004.
25. H. Kellerer, U. Pferschy, and D. Pisinger. Introduction to NPCompleteness of knapsack problems. Springer-Verlag, 2004.
26. Nci. http://cactus.nci.nih.gov/download/nci.
27. Fda. http://cactus.nci.nih.gov/download/fda.
28. C. Dwork and A. Roth. The algorithmic foundations of differential privacy. Theoretical Computer Science, 2013.