Skip to main content

An Agent Based Privacy Preserving Mining for Distributed Databases

  • Conference paper
Computational and Information Science (CIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3314))

Included in the following conference series:

  • 1205 Accesses

Abstract

This paper introduces a novel paradigm of privacy preserving mining for distributed databases. The paradigm includes an agent-based approach for distributed learning of a decision tree to fully analyze data located at several distributed sites without revealing any information at each site. The distributed decision tree approach has been developed from the well-known decision tree algorithm, for the distributed and privacy preserving data mining process. It is performed on the agent based architecture dealing with distributed databases in a collaborative fashion. This approach is very useful to be applied to a variety of domains which require information security and privacy during data mining process.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

References

  • Agrawal, S., Krishnan, V., Haritsa, R.J.: On Addressing Efficiency Concerns in Privacy Preserving Mining. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 113–124. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Malvestuto, M.F., Mezzini, M.: Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type. In: Domingo-Ferrer, J., Torra, V. (eds.) PSD 2004. LNCS, vol. 3050, pp. 353–365. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 36. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  • Krishnaswamy, S., Zaslavsky, A., Loke, S.W.: Techniques for Estimating the Computation and Communication Costs of Distributed Data Mining. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol. 2329, pp. 603–612. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  • Aggarwal, C.C., Yu, P.S.: A Condensation Approach to Privacy Preserving Data Mining. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 183–199. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining, pp. 99–106 (2003)

    Google Scholar 

  • Kargupta, H., Park, B., Hershberger, D., Johnson, E.: Collective Data Mining: A New Perspective Toward Distributed Data Analysis. Advances in Distributed and Parallel Knowledge Engineering 5, 131–178 (2000)

    Google Scholar 

  • Kargupta, H., Hamzaoglu, I., Stafford, B.: Scalable, Distributed Data Mining-An Agent Architecture. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 211–214 (1997)

    Google Scholar 

  • Stolfo, S., Prodromidis, A.L., Tselepis, S., Lee, W.: JAM: Java Agents for Meta-Learning over Distributed Databases. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 74–81 (1997)

    Google Scholar 

  • Bailey, S., Grossman, R., Sivakumar, H., Turinsky, A.: Papyrus: a system for data mining over local and wide area clusters and super-clusters. In: Proceedings of the International Conference on Supercomputing (1999)

    Google Scholar 

  • Klusch, M., Lodi, S., Moro, G.: Agent-Based Distributed Data Mining: The KDEC Scheme. In: Klusch, M., Bergamaschi, S., Edwards, P., Petta, P. (eds.) Intelligent Information Agents. LNCS (LNAI), vol. 2586, pp. 104–122. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  • Quinlan, J.R., Rivest, R.L.: Inferring Decision Trees Using the Minimum Description Length Principle. Information and Computation 80 (1989)

    Google Scholar 

  • See Web site at http://www.kdnuggets.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baik, S.W., Bala, J., Rhee, D. (2004). An Agent Based Privacy Preserving Mining for Distributed Databases. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_140

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30497-5_140

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30497-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics