Using Minimum Local Distortion to Hide Decision Tree Rules
AbstractThe sharing of data among organizations has become an increasingly common procedure in several areas like banking, electronic commerce, advertising, marketing, health, and insurance sectors. However, any organization will most likely try to keep some patterns hidden once it shares its datasets with others. This article focuses on preserving the privacy of sensitive patterns when inducing decision trees. We propose a heuristic approach that can be used to hide a certain rule which can be inferred from the derivation of a binary decision tree. This hiding method is preferred over other heuristic solutions like output perturbation or cryptographic techniques—which limit the usability of the data—since the raw data itself is readily available for public use. This method can be used to hide decision tree rules with a minimum impact on all other rules derived. View Full-Text
Share & Cite This Article
Feretzakis, G.; Kalles, D.; Verykios, V.S. Using Minimum Local Distortion to Hide Decision Tree Rules. Entropy 2019, 21, 334.
Feretzakis G, Kalles D, Verykios VS. Using Minimum Local Distortion to Hide Decision Tree Rules. Entropy. 2019; 21(4):334.Chicago/Turabian Style
Feretzakis, Georgios; Kalles, Dimitris; Verykios, Vassilios S. 2019. "Using Minimum Local Distortion to Hide Decision Tree Rules." Entropy 21, no. 4: 334.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.