Differentially Private Frequent Itemset Mining via Transaction Splitting

IEEE Transactions on Knowledge and Data Engineering

Volumn 27, Issue 7, 2015, Pages 1875-1891

  Su, Sen ^a   Xu, Shengzhi ^a   Cheng, Xiang ^a   Li, Zhengyi ^a   Yang, Fangchun ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

differential privacy; Frequent itemset mining; transaction splitting

Indexed keywords

ALGORITHMS; DATA PRIVACY; DATABASE SYSTEMS;

DIFFERENTIAL PRIVACIES; DOWNWARD CLOSURE PROPERTIES; FP-GROWTH ALGORITHM; FREQUENT ITEMSET MINING; HIGH TIME EFFICIENCY; PREPROCESSING PHASE; STATE-OF-THE-ART TECHNIQUES; TRANSACTION SPLITTING;

DATA MINING;

EID: 84959279998     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2015.2399310     Document Type: Article

References (28)

1. C. Dwork, "Differential privacy," in Proc. Int. Colloquium Automata, Languages Programm., 2006, pp. 1-12, http://link.springer.com/chapter/10.1007%2F11787006-1
2. L. Sweeney, "k-anonymity: A model for protecting privacy," Int. J. Uncertainity Fuzziness Knowl.-Base Syst., vol. 10, no. 5, pp. 557-570, 2002.
3. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, "l-diversity: Privacy beyond k-anonymity," in Proc. 22nd Int. Conf. Data Eng., 2006, p. 24.
4. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. 20th Int. Conf. Very Large Data Bases, 1994, pp. 487-499.
5. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2000, pp. 1-12.
6. C. Zeng, J. F. Naughton, and J.-Y. Cai, "On differentially private frequent itemset mining," Proc. VLDB Endowment, vol. 6, no. 1, pp. 25-36, 2012.
7. J. Vaidya and C. Clifton, "Privacy preserving association rule mining in vertically partitioned data," in Proc. 8th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2002, pp. 639-644.
8. M. Kantarcioglu and C. Clifton, "Privacy-preserving distributed mining of association rules on horizontally partitioned data," IEEE Trans. Knowl. Data Eng., vol. 16, no. 9, pp. 1026-1037, Sep. 2004.
9. W. K. Wong, D. W. Cheung, E. Hung, B. Kao, and N. Mamoulis, "Security in outsourcing of association rule mining," in Proc. 33rd Int. Conf. Very Large Data Bases, 2007, pp. 111-122.
10. W. K. Wong, D. W. Cheung, E. Hung, B. Kao, and N. Mamoulis, "An audit environment for outsourcing of frequent itemset mining," Proc. VLDB Endowment, vol. 2, no. 1, pp. 1162-1173, 2009.
11. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, "Privacy preserving mining of association rules," in Proc. 8th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2002, pp. 217-228.
12. Maurizio Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi, "Anonymity preserving pattern discovery," VLDB J., vol. 17, no. 4, pp. 703-727, 2008.
13. R. Bhaskar, S. Laxman, A. Smith, and A. Thakurta, "Discovering frequent patterns in sensitive data," in Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2010, pp. 503-512.
14. N. Li, W. Qardaji, D. Su, and J. Cao, "Privbasis: Frequent itemset mining with differential privacy," Proc. VLDB Endowment, vol. 5, no. 11, pp. 1340-1351, 2012.
15. F. McSherry and K. Talwar, "Mechanism design via differential privacy," in Proc. 48th Annu. IEEE Symp. Found. Comput. Sci., 2007, pp. 94-103.
16. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Proc. 3rd Conf. Theory Cryptography, 2006, pp. 265-284.
17. R. Chen, N. Mohammed, B. C. M. Fung, B. C. Desai, and L. Xiong, "Publishing set-valued data via differential privacy," in Proc. Int. Conf. Very Large Data Bases, 2011, pp. 1087-1098.
18. X. Zhang, X. Meng, and R. Chen, "Differentially private set-valued data release against incremental updates," in Proc. 18th Int. Conf. Database Syst. Adv. Appl., 2013, pp. 392-406.
19. L. Bonomi and L. Xiong, "A two-phase algorithm for mining sequential patterns with differential privacy," in Proc. 22nd ACM Conf. Inf. Knowl. Manage., 2013, pp. 269-278.
20. E. Shen and T. Yu, "Mining frequent graph patterns with differential privacy," in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 545-553.
21. R. Chen, B. C. M. Fung, and B. C. Desai, "Differentially private transit data publication: A case study on the montreal transportation system," in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 213-221.
22. R. Chen, G. Acs, and C. Castelluccia, "Differentially private sequential data publication via variable-length n-grams," in Proc. ACM Conf. Comput. Commun. Security, 2012, pp. 638-649.
23. A. Ghosh, T. Roughgarden, and M. Sundararajan, "Universally utility-maximizing privacy mechanisms," SIAM J. Comput., vol. 41, no. 6, pp. 1673-1693, 2012.
24. L. Parsons, E. Haque, and H. Liu, "Subspace clustering for high dimensional data: A review," SIGKDD Explorations, vol. 6, no. 1, pp. 90-105, 2004.
25. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks,"J. Statist. Mech.: Theory Experiment, vol. 10, p. P10008, 2008.
26. N. Guttmann-Beck and R. Hassin, "Approximation algorithms for minimum sum p-clustering," Discrete Appl. Math., vol. 89, nos. 1-3, pp. 125-142, 1998.
27. Z. Zheng, R. Kohavi, and L. Mason, "Real world performance of association rule algorithms," in Proc. 7th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2001, pp. 401-406.
28. Frequent itemset mining dataset repository [Online]. Available: http:// fimi.ua.ac.be/data, 2004.