Skip to main content

KD3 Scheme for Privacy Preserving Data Mining

  • Conference paper
  • 1361 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3975))

Abstract

Privacy preserving data mining is a novel research direction. The main objective is to develop algorithms for modifying the original data in some way, so that the private information remains private even fter the mining process.

Agrawal and Srikant first proposed a scheme for privacy preserving data mining using random perturbation [1]. Then, Rizvi and Haritsa presented a scheme called MASK to mine associations with secrecy constraints [2]; Du and Zhan proposed an approach to conduct privacy preserving decision tree building [3]. A methodology for hiding knowledge in database was also presented and applied to classification and association rule mining [4]. However, all those approaches are different in their frameworks and processes. Only can they deal with a special data type, a given mining algorithm, and one kind of the attribute of private information.

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

References

  1. Agrawal, R., Srikant, R.: Privacy-Preserving Data Mining. In: Proceedings of the ACM SIGMOD Conference on Management of Data (2000)

    Google Scholar 

  2. Rizvi, S.J., Haritsa, J.R.: Maintaining Data Privacy in Association Rule Mining. In: Proceedings of the 28th International Conference on Very Large Data Bases (2002)

    Google Scholar 

  3. Du, W., Zhan, Z.: Using Randomized Response Techniques for Privacy-Preserving Data Mining. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)

    Google Scholar 

  4. Johnsten, T., Raghavan, V.V.: A Methodology for Hiding Knowledge in Databases. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining (2002)

    Google Scholar 

  5. Zhang, P., Tong, Y., Tang, S., Yang, D.: Privacy Preserving Naive Bayes Classification. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol. 3584, pp. 744–752. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Zhang, P., Tong, Y., Tang, S., Yang, D.: Mining Association Rules from Distorted Data for Privacy Preservation. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3683, pp. 1345–1351. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, P., Tong, Y., Tang, S., Yang, D. (2006). KD3 Scheme for Privacy Preserving Data Mining. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760146_78

Download citation

  • DOI: https://doi.org/10.1007/11760146_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34478-0

  • Online ISBN: 978-3-540-34479-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics