Mining multiple private databases using a kNN classifier

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

Abstract

Modern electronic communication has collapsed geographical boundaries for global information sharing but often at the expense of data security and privacy boundaries. Distributed privacy preserving data mining tools are increasingly becoming critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model as well as multi-round algorithms for mining horizontally partitioned databases using a privacy preserving k Nearest Neighbor (kNN) classifier. A salient feature of our approach is that it offers a trade-off between accuracy, efficiency and privacy through multi-round protocols. Copyright 2007 ACM.

Cite

CITATION STYLE

APA

Xiong, L., Chitti, S., & Liu, L. (2007). Mining multiple private databases using a kNN classifier. In Proceedings of the ACM Symposium on Applied Computing (pp. 435–440). Association for Computing Machinery. https://doi.org/10.1145/1244002.1244102

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