Skip to main content

Privacy Preserving Decision Tree in Multi Party Environment

  • Conference paper
Information Retrieval Technology (AIRS 2005)

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

Included in the following conference series:

Abstract

Recently, there have been increasing interests on how to preserve the privacy in data mining when source of data are distributed across multi parties. In this paper, we focus on the privacy preserving on decision tree in multi party environment when data are vertically partitioned. We propose novel private decision tree algorithms applied to building and classification stages. The main advantage of our work over the existing ones is that each party cannot use the public decision tree to infer the other’s private data. With our algorithms, the communication cost during tree building stage is reduced compared to existing methods and the number of involving parties could be extended to be more than two parties.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kantarcioglou, M., Clifton, C.: Privacy-preserving Distributed Mining of Association Rules on horizontally Partitioned Data. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 24–31 (2002)

    Google Scholar 

  2. Vaidya, J., Clifton, C.: Privacy, Preserving Association Rule Mining in Vertically Partitioned Data. In: ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp. 639–644 (2002)

    Google Scholar 

  3. Du, W., Zhan, Z.: Building Decision Tree Classifier on Private Data. In: IEEE ICDM Workshop on Privacy, Security and Data Mining, pp. 1–8 (2002)

    Google Scholar 

  4. Yao, A.C.: Protocols for Secure Computations. In: IEEE Symp. Foundations of Computer Science (1982)

    Google Scholar 

  5. Agrawal, R., Evfimievski, A., Srikant, R.: Information Sharing Across Private Databases. In: ACM SIGMOD Int. Conf. Management of Data, pp. 86–97 (2003)

    Google Scholar 

  6. Rose Quinlan, J.: Induction of Decision Trees. Machine Learning 1, 81–106 (1986)

    Google Scholar 

  7. Shrikant Vaidya, J.: Privacy Preserving Data Mining Over Vertically Partitioned Data. Ph.D Thesis of Purdue University, pp. 28–34 (August 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suthampan, E., Maneewongvatana, S. (2005). Privacy Preserving Decision Tree in Multi Party Environment. In: Lee, G.G., Yamada, A., Meng, H., Myaeng, S.H. (eds) Information Retrieval Technology. AIRS 2005. Lecture Notes in Computer Science, vol 3689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562382_75

Download citation

  • DOI: https://doi.org/10.1007/11562382_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29186-2

  • Online ISBN: 978-3-540-32001-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics