Evidence map›Paper›PMID 33267048›Full record

ArticleEntropy (Basel, Switzerland)2019

Using Minimum Local Distortion to Hide Decision Tree Rules.

Georgios Feretzakis, Dimitris Kalles, Vassilios S Verykios

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Georgios FeretzakisSchool of Science and Technology, Hellenic Open University, 263 35 Patras, Greece.ORCID 0000-0002-3597-1187
Dimitris KallesSchool of Science and Technology, Hellenic Open University, 263 35 Patras, Greece.ORCID 0000-0003-0364-5966
Vassilios S VerykiosSchool of Science and Technology, Hellenic Open University, 263 35 Patras, Greece.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The 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.

Indexed as

data sharingdecision treesentropyhiding rulesinformation gainprivacy preserving

Identifiers

PMID33267048
PMCPMC7514818

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.