Skip to main content

A Survey on Preserving Privacy for Sensitive Association Rules in Databases

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 70))

Abstract

Privacy preserving data mining (PPDM) is a novel research area to preserve privacy for sensitive knowledge from disclosure. Many of the researchers in this area have recently made effort to preserve privacy for sensitive knowledge in statistical database. In this paper, we present a detailed overview and classification of approaches which have been applied to knowledge hiding in context of association rule mining. We describe some evaluation metrics which are used to evaluate the performance of presented hiding algorithms.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atallah, M., Bertino, E., Elmagarmid, A.K., Ibrahim, M., Verykios, V.S.: Disclosure limitation of sensitive rules. In: Proc. of the 1999 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX 1999), pp. 45–52 (1999)

    Google Scholar 

  2. Oliveira, S.R.M., Zaïane, O.R., Saygın, Y.: Secure Association Rule Sharing. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 74–85. Springer, Heidelberg (2004)

    Google Scholar 

  3. Gkoulalas-Divanis, A., Verykios, V.S.: An Integer Programming Approach for Frequent Itemset Hiding. In: Proc. ACM Conf. Information and Knowledge Management (CIKM 2006), pp. 748–757 (2006)

    Google Scholar 

  4. Saygin, Y., Verykios, V.S., Clifton, C.: Using Unknowns to Prevent Discovery of Association Rules. ACM SIGMOD 30(4), 45–54 (2001)

    Article  Google Scholar 

  5. Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proc. Int’l. Conf. Knowledge Discovery and Data Mining, pp. 639–644 (2002)

    Google Scholar 

  6. Mielikainen, T.: On inverse frequent set mining. In: Proc. 3rd IEEE ICDM Workshop on Privacy Preserving Data Mining, pp. 18–23. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  7. Sun, X., Yu, P.S.: A Border-Based Approach for Hiding Sensitive Frequent Itemsets. In: Proc. Fifth IEEE Int’l. Conf. Data Mining (ICDM 2005), pp. 426–433 (2005)

    Google Scholar 

  8. Verykios, V.S., Elmagarmid, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association rule hiding. IEEE Transactions on Knowledge and Data Engineering 16(4), 434–447 (2004)

    Article  Google Scholar 

  9. Gkoulalas-Divanis, A., Verykios, V.S.: Exact Knowledge Hiding through Database Extension. IEEE Transactions on Knowledge and Data Engineering 21(5), 699–713 (2009)

    Article  Google Scholar 

  10. Moustakides, G.V., Verykios, V.S.: A Max-Min Approach for Hiding Frequent Itemsets. In: Proc. Sixth IEEE Int’l. Conf. Data Mining (ICDM 2006), pp. 502–506 (2006)

    Google Scholar 

  11. Wu, Y.H., Chiang, C.M., Chen, A.L.P.: Hiding Sensitive Association Rules with Limited Side Effects. IEEE Transactions on Knowledge and Data Engineering 19(1), 29–42 (2007)

    Article  Google Scholar 

  12. Saygin, Y., Verykios, V.S., Elmagarmid, A.K.: Privacy preserving association rule mining. In: Proc. Int’l. Workshop on Research Issues in Data Engineering (RIDE 2002), pp. 151–163 (2002)

    Google Scholar 

  13. Guo, Y.: Reconstruction-Based Association Rule Hiding. In: Proc. of SIGMOD 2007 Ph.D. Workshop on Innovative Database Research (2007)

    Google Scholar 

  14. Wang, S.L., Jafari, A.: Using unknowns for hiding sensitive predictive association rules. In: Proc. IEEE Int’l. Conf. Information Reuse and Integration (IRI 2005), pp. 223–228 (2005)

    Google Scholar 

  15. Duraiswamy, K., Manjula, D.: Advanced approach in sensitive rule hiding. Modern Applied Science 3(2) (2009)

    Google Scholar 

  16. Kantarcioglu, M., Clifton, C.: Privacy preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering 16(9), 1026–1037 (2004)

    Article  Google Scholar 

  17. Aggarwal, C.C., Yu, P.S.: Privacy-Preserving Data Mining: Models and Algorithms, pp. 267–286. Springer, Heidelberg (2008)

    Book  Google Scholar 

  18. Han, J., Kamber, M.: Data Mining: Concepts and Techniques, pp. 227–245. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Modi, C., Rao, U.P., Patel, D.R. (2010). A Survey on Preserving Privacy for Sensitive Association Rules in Databases. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_96

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12214-9_96

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12213-2

  • Online ISBN: 978-3-642-12214-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics