Privacy preserving ID3 algorithm over horizontally partitioned data

Mingjun Xiao, Liusheng Huang, Hong Shen, Yonglong Luo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

49 Citations (Scopus)

Abstract

For the problem of decision tree classification with privacy concerns, we propose several efficient secure multi-party computation protocols to construct a privacy preserving ID3 algorithm over horizontally partitioned data among multiple parties. Our algorithm presents the first solution to privacy preserving decision tree classification among more than two parties. We also make a performance comparison with the existing solution, which is only applicable to the two-party case. The result shows that our solution has a significantly better performance.

Original languageEnglish
Title of host publicationProceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Pages239-243
Number of pages5
Publication statusPublished - 2005
Externally publishedYes
Event6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 - Dalian, China
Duration: 5 Dec 20058 Dec 2005

Publication series

NameParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
Volume2005

Conference

Conference6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Country/TerritoryChina
CityDalian
Period5/12/058/12/05

Fingerprint

Dive into the research topics of 'Privacy preserving ID3 algorithm over horizontally partitioned data'. Together they form a unique fingerprint.

Cite this