Mining frequent graph patterns with differential privacy

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn Part F128815, Issue , 2013, Pages 545-553

  Shen, Entong ^a   Yu, Ting ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Differential privacy; Graph pattern mining

Indexed keywords

DATA PRIVACY; MARKOV PROCESSES;

DIFFERENTIAL PRIVACIES; FREQUENT GRAPH PATTERNS; FREQUENT ITEMSET MINING; GRAPH PATTERNS; MARKOV CHAIN MONTE CARLO; PRIVATE DATA ANALYSIS; SAMPLING-BASED ALGORITHMS; STRUCTURAL INFORMATION;

DATA MINING;

EID: 84989250474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487601     Document Type: Conference Paper

References (30)

1. C. Aggarwal and S. Philip. Privacy-preserving data mining: models and algorithms. 2008.
2. M. Al Hasan and M. J. Zaki. Output space sampling for graph patterns. Proc. VLDB, 2(1):730-741, 2009.
3. R. Bhaskar, S. Laxman, A. Smith, and A. Thakurta. Discovering frequent patterns in sensitive data. In KDD, pages 503-512, 2010.
4. J. Cheng, Y. Ke, and W. Ng. Graphgen: A graph synthetic generator. http://www.cse.ust.hk/graphgen, 2006.
5. L. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub) graph isomorphism algorithm for matching large graphs. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 26(10), 2004.
6. G. Cormode, C. Procopiuc, E. Shen, D. Srivastava, and T. Yu. Differentially Private Spatial Decompositions. ICDE, 2012.
7. B. Ding, M. Winslett, and J. Han. Differentially private data cubes: optimizing noise sources and consistency. SIGMOD, 2011.
8. C. Dwork, K. Kenthapadi, and F. McSherry. Our data, ourselves: Privacy via distributed noise generation. Advances in Cryptology, 2006.
9. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. Theory of Cryptography, pages 265-284, 2006.
10. J. Geweke. Evaluating the accuracy of sampling-based approaches to the calculation of posterior moments. In Bayesian Statistics, 1992.
11. W. Gilks, S. Richardson, and D. Spiegelhalter. Markov chain Monte Carlo in practice. Chapman & Hall/CRC, 1996.
12. M. Gjoka, M. Kurant, C. Butts, and A. Markopoulou. Walking in facebook: A case study of unbiased sampling of osns. In INFOCOM, pages 1-9, 2010.
13. M. Hay, C. Li, G. Miklau, and D. Jensen. Accurate Estimation of the Degree Distribution of Private Networks. ICDE, pages 169-178, Dec. 2009.
14. S.-S. Ho and S. Ruan. Differential privacy for location pattern mining. In SIGSPATIAL Workshop on Security and Privacy in GIS and LBS, pages 17-24. ACM, 2011.
15. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. Principles of Data Mining and Knowledge Discovery, pages 13-23, 2000.
16. V. Karwa, S. Raskhodnikova, and A. Smith. Private Analysis of Graph Structure. Proceedings of the VLDB, 4(11):1146-1157, 2011.
17. N. Li, W. Qardaji, D. Su, and J. Cao. Privbasis: frequent itemset mining with differential privacy. VLDB Endow., 5(11), July 2012.
18. A. Machanavajjhala, A. Korolova, and A. Sarma. Personalized social recommendations-Accurate or private? VLDB, 4(7), 2011.
19. F. McSherry and I. Mironov. Differentially Private Recommender Systems: Building Privacy into the Netflix Prize Contenders. In KDD, pages 627-636, 2009.
20. F. McSherry and K. Talwar. Mechanism Design via Differential Privacy. FOCS, 2007.
21. D. Mehmood, B. Shafiq, J. Vaidya, Y. Hong, N. Adam, and V. Atluri. Privacy-preserving subgraph discovery. In Data and Applications Security and Privacy XXVI, pages 161-176. Springer, 2012.
22. N. Mohammed, R. Chen, B. C. M. Fung, and P. S. Yu. Differentially Private Data Release for Data Mining. KDD, 2011.
23. A. Nanavati, S. Gurumurthy, G. Das, D. Chakraborty, K. Dasgupta, S. Mukherjea, and A. Joshi. On the structural properties of massive telecom call graphs: findings and implications. In Proceedings of CIKM, pages 435-444. ACM, 2006.
24. R. Rubinstein and D. Kroese. Simulation and the Monte Carlo method. Wiley, 2008.
25. A. Sala, X. Zhao, C. Wilson, H. Zheng, and B. Y. Zhao. Sharing graphs using differentially private graph models. In Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference, pages 81-98. ACM, 2011.
26. E. Shen and T. Yu. Mining frequent graph patterns with differential privacy. http://arxiv.org/abs/1301.7015.
27. O. Williams and F. McSherry. Probabilistic inference and differential privacy. In Neural Information Processing Systems (NIPS), 2010.
28. X. Xiao, G. Wang, and J. Gehrke. Differential privacy via wavelet transforms. IEEE Transactions on Knowledge and Data Engineering, pages 1200-1214, 2010.
29. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, 2002.
30. M. Zaki. Efficiently mining frequent trees in a forest: Algorithms and applications. Knowledge and Data Engineering, IEEE Transactions on, 17(8):1021-1035, 2005.