An agent based privacy preserving mining for distributed databases

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Baik, S. W., Bala, J., & Rhee, D. (2004). An agent based privacy preserving mining for distributed databases. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3314, 910–915. https://doi.org/10.1007/978-3-540-30497-5_140

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free