Back to Search Start Over

Privacy-Preserving Multiparty Collaborative Mining with Geometric Data Perturbation.

Authors :
Chen, Keke
Ling Liu
Source :
IEEE Transactions on Parallel & Distributed Systems. Dec2009, Vol. 20 Issue 12, p1764-1776. 13p.
Publication Year :
2009

Abstract

In multiparty collaborative data mining, participants contribute their own data sets and hope to collaboratively mine a comprehensive model based on the pooled data set. How to efficiently mine a quality model without breaching each party's privacy is the major challenge. In this paper, we propose an approach based on geometric data perturbation and data mining service-oriented framework. The key problem of applying geometric data perturbation in multiparty collaborative mining is to securely unify multiple geometric perturbations that are preferred by different parties, respectively. We have developed three protocols for perturbation unification. Our approach has three unique features compared to the existing approaches: 1) with geometric data perturbation, these protocols can work for many existing popular data mining algorithms, while most of other approaches are only designed for a particular mining algorithm; 2) both the two major factors: data utility and privacy guarantee are well preserved, compared to other perturbation- based approaches; and 3) two of the three proposed protocols also have great scalability in terms of the number of participants, while many existing cryptographic approaches consider only two or a few more participants. We also study different features of the three protocols and show the advantages of different protocols in experiments. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
10459219
Volume :
20
Issue :
12
Database :
Academic Search Index
Journal :
IEEE Transactions on Parallel & Distributed Systems
Publication Type :
Academic Journal
Accession number :
47099419
Full Text :
https://doi.org/10.1109/TPDS.2009.26