Advertisement

Mining Representative Patterns Under Differential Privacy

  • Xiaofeng DingEmail author
  • Long Chen
  • Hai Jin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10570)

Abstract

Representative frequent pattern mining from a transaction dataset has been well studied in both the database and the data mining community for many years. One popular scenario is that if the input dataset contains private information, publishing representative patterns may pose great threats to individual’s privacy. In this paper, we study the subject of mining representative patterns under the differential privacy model. We propose a method that combines RPlocal with differential privacy to mine representative patterns. We analyze the breach of privacy in RPlocal, and utilize the differential privacy to protect the private information of transaction dataset. Through formal privacy analysis, we prove that our proposed algorithm satisfies \(\epsilon \)-differential privacy. Extensive experimental results on real datasets reveal that our algorithm produces similar number of representative patterns compared to RPlocal.

Keywords

Representative pattern Differential privacy RPlocal 

Notes

Acknowledgment

This work is supported by the NSFC under grant No. 61472148 and the National Basic Research Program of China (973 Program) under grant No. 2014CB340600.

References

  1. 1.
    Frequent patterns mining dataset repository. http://fimi.ua.ac.be/data
  2. 2.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 478–499 (1994)Google Scholar
  3. 3.
    Bayardo, R.J.: Efficiently mining long patterns from databases. In: SIGMOD, pp. 85–93 (1998)CrossRefGoogle Scholar
  4. 4.
    Bhaskar, R., Laxman, S., Smith, A., Thakurta, A.: Discovering frequent patterns in sensitive data. In: SIGKDD, pp. 503–512 (2010)Google Scholar
  5. 5.
    Bonomi, L., Xiong, L.: A two-phase algorithm for mining sequential patterns with differential privacy. In: CIKM, pp. 269–278 (2013)Google Scholar
  6. 6.
    Chen, J., Xiao, K.: BISC: a bitmap itemset support counting approach for efficient frequent itemset mining. In TKDD, pp. 481–482 (2010)Google Scholar
  7. 7.
    Chen, R., Mohammed, N., Fung, B.C.M., Desai, B.C., Xiong, L.: Publishing setvalued data via differential privacy. In: VLDB, pp. 1087–1098, April 2011Google Scholar
  8. 8.
    Cormode, G., Procopiuc, C., Srivastava, D., Shen, E., Yu, T.: Differentially private spatial decompositions. In: ICDE, pp. 20–31 (2012)Google Scholar
  9. 9.
    Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006). doi: 10.1007/11787006_1CrossRefGoogle Scholar
  10. 10.
    Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: ICDM, pp. 163–170 (2001)Google Scholar
  11. 11.
    He, Y., Naughton, J.F.: Anonymization of setvalued data via topdown, local generalization. In: VLDB, pp. 934–945 (2009)CrossRefGoogle Scholar
  12. 12.
    Lee, J., Clifton, C.W.: Top-k frequent itemsets via differentially private FP-trees. In: SIGKDD, pp. 931–940 (2014)Google Scholar
  13. 13.
    Li, C., Hay, M., Miklau, G., Wang, Y.: A data and workload-aware algorithm for range queries under differential privacy. In: VLDB, pp. 341–352 (2014)CrossRefGoogle Scholar
  14. 14.
    Li, N., Qardaji, W., Su, D., Cao, J.: Privbasis: frequent itemset mining with differential privacy. In VLDB, pp. 1340–1351 (2012)CrossRefGoogle Scholar
  15. 15.
    Liu, G., Zhang, H., Wong, L.: A flexible approach to finding representative pattern sets. In: TKDE, pp. 1562–1574 (2014)Google Scholar
  16. 16.
    Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: privacy beyond k-anonymity. In: ICDE, p. 24 (2006)Google Scholar
  17. 17.
    Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1999). doi: 10.1007/3-540-49257-7_25CrossRefGoogle Scholar
  18. 18.
    Su, S., Xu, S., Cheng, X., Li, Z., Yang, F.: Differentially private frequent itemset mining via transaction splitting. In: TKDE, pp. 1564–1565 (2016)Google Scholar
  19. 19.
    Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness. Knowl.-Based Syst. 10, 557–570 (2002)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: SIGKDD, pp. 236–245 (2003)Google Scholar
  21. 21.
    Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB, pp. 702–720 (2005)Google Scholar
  22. 22.
    Zeng, C., Naughton, J.F., Cai, J.Y.: On differentially private frequent itemset mining. In: VLDB, pp. 25–36 (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Service Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations