Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7985
Title: Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
Authors: KUIJPERS, Bart 
LEMMENS, Vanessa
MOELANS, Bart 
TUYLS, Karl 
Issue Date: 2008
Source: ArXiv Computing Research Repository (CoRR)
Abstract: We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same problem in the case where the data is both horizontally and vertically distributed, a situation we refer to as grid partitioned data. We give an algorithm for privacy preserving ID3 over horizontally partitioned data involving more than two parties. For grid partitioned data, we discuss two different evaluation methods for preserving privacy ID3, namely, first merging horizontally and developing vertically or first merging vertically and next developing horizontally. Next to introducing privacy preserving data mining over grid-partitioned data, the main contribution of this paper is that we show, by means of a complexity analysis that the former evaluation method is the more efficient.
Notes: Available at: ArXiv Computing Research Repository (CoRR)
Document URI: http://hdl.handle.net/1942/7985
Link to publication: http://arxiv.org/abs/0803.1555v1
Category: O
Type: Preprint
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
KLMT08.pdfArXiv version197.25 kBAdobe PDFView/Open
Show full item record

Page view(s)

12
checked on May 17, 2022

Download(s)

4
checked on May 17, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.