Embedding differential privacy in decision tree algorithm with different depths

doi:10.1007/s11432-016-0442-1

Embedding differential privacy in decision tree algorithm with different depths

2017-07-06

8

PRE

AI

DOI：10.1007/s11432-016-0442-1

Original

Original request for help

Save

Abstract

En 中文

Differential privacy (DP) has become one of the most important solutions for privacy protection in recent years. Previous studies have shown that prediction accuracy usually increases as more data mining (DM) logic is considered in the DP implementation. However, although one-step DM computation for decision tree (DT) model has been investigated, existing research has not studied the scenarios when the DP is embedded in two-step DM computation, three-step DM computation until the whole model DM computation. It is very challenging to embed DP in more than two steps of DM computation since the solution space exponentially increases with the increase of computational complexity. In this work, we propose algorithms by making use of Markov Chain Monte Carlo (MCMC) method, which can efficiently search a computationally infeasible space to embed DP into DT generation algorithm. We compare the performance when embedding DP in DT with different depths, i.e., one-step DM computation (previous work), two-step, three-step and the whole model. We find that the deep combination of DP and DT does help to increase the prediction accuracy. However, when the privacy budget is very large (e.g., ? = 10), this may overwhelm the complexity of DT model, and the increasing trend is not obvious. We also find that the prediction accuracy decreases with the increase of model complexity.

Keywords:

differential privacy

decision tree

exponential mechanism

exhaustive search

MCMC

Embedding differential privacy in decision tree algorithm with different depths

Abstract

AI Summary

Journal

Organization