Differentially private random decision forests using smooth sensitivity
Authors:
- Sam FletcherSFSam Fletcher
- Zahidul IslamZIZahidul Islam
- 1 July 2017
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 78, 16-31
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- An anonymization technique using intersected decision treesJournal of King Saud University Computer and Information Sciences, 2015
- A fast perturbation algorithm using tree structure for privacy preserving utility miningExpert Systems with Applications, 2015
- A data- and workload-aware algorithm for range queries under differential privacyProceedings of the VLDB Endowment, 2014
- A learning theory approach to noninteractive database privacyJournal of the ACM, 2013
- Privacy preserving data mining: A noise addition framework using a novel clustering techniqueKnowledge-Based Systems, 2011
- A firm foundation for private data analysisCommunications of the ACM, 2011
- Extremely randomized treesMachine Learning, 2006
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSIONInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Statistical Modeling: The Two Cultures (with comments and a rejoinder by the author)Statistical Science, 2001
- The meaning and use of the area under a receiver operating characteristic (ROC) curve.Radiology, 1982