Differentially Private Random Forest With High Utility
2015 IEEE International Conference on Data Mining(2015)
摘要
Privacy-preserving data mining has become an active focus of the research community in the domains where data are sensitive and personal in nature. We propose a novel random forest algorithm under the framework of differential privacy. Unlike previous works that strictly follow differential privacy and keep the complete data distribution approximately invariant to change in one data instance, we only keep the necessary statistics (e.g. variance of the estimate) invariant. This relaxation results in significantly higher utility. To realize our approach, we propose a novel differentially private decision tree induction algorithm and use them to create an ensemble of decision trees. We also propose feasible adversary models to infer about the attribute and class label of unknown data in presence of the knowledge of all other data. Under these adversary models, we derive bounds on the maximum number of trees that are allowed in the ensemble while maintaining privacy. We focus on binary classification problem and demonstrate our approach on four real-world datasets. Compared to the existing privacy preserving approaches we achieve significantly higher utility.
更多查看译文
关键词
differential privacy,decision trees,random forest,privacy preserving data mining
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络