Privacy Preserving Aggregation of Secret Classifiers

  • Authors:
  • Gé/rald Gavin;Julien Velcin;Philippe Aubertin

  • Affiliations:
  • ERIC Lab - University of Lyon - 5/ avenue Pierre Mendè/s France. e-mail: gavin@univ-lyon1.fr;ERIC Lab - University of Lyon - 5/ avenue Pierre Mendè/s France. e-mail: julien.velcin@univ-lyon2.fr;Axopen, 17/ lot colline du Châ/tel/ 01120 Dagneux/ France. e-mail: aubertinp@gmail.com

  • Venue:
  • Transactions on Data Privacy
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we address the issue of privacy preserving data-mining. Specifically, we consider a scenario where each member j of T parties has its own private database. The party j builds a private classifier hj for predicting a binary class variable y. The aim of this paper consists of aggregating these classifiers hj in order to improve individual predictions. More precisely, the parties wish to compute an efficient linear combination over their classifier in a secure manner.