An ensemble learning model based on differentially private decision tree

An ensemble learning model based on differentially private decision tree

Using differential privacy to provide privacy protection for classification algorithms has become a research hotspot in data mining. In this paper, we analyze the defects in the differentially private decision tree named Maxtree, and propose an improved model DPtree. DPtree can use the Fayyad theore...

Full description

Saved in:
Bibliographic Details
Published in:Complex & intelligent systems 2023-10, Vol.9 (5), p.5267-5280
Main Authors: Niu, Xufeng, Ma, Wenping
Format: Article
Language:eng
Subjects:
Classification
Complexity
Computational Intelligence
Data analysis
Data mining
Data Structures and Information Theory
Decision analysis
Decision making
Decision tree
Decision trees
Differential privacy
Disclosure
Engineering
Ensemble learning
Genetic algorithms
Immigration
Intelligent systems
Machine learning
Operators (mathematics)
Original Article
Personal information
Privacy
Quantum genetic algorithm
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Using differential privacy to provide privacy protection for classification algorithms has become a research hotspot in data mining. In this paper, we analyze the defects in the differentially private decision tree named Maxtree, and propose an improved model DPtree. DPtree can use the Fayyad theorem to process continuous features quickly, and can adjust privacy budget adaptively according to sample category distributions in leaf nodes. Moreover, to overcome the inevitable decline of classification ability of differentially private decision trees, we propose an ensemble learning model for DPtree, namely En-DPtree. In the voting process of En-DPtree, we propose a multi-population quantum genetic algorithm, and introduce immigration operators and elite groups to search the optimal weights for base classifiers. Experiments show that the performance of DPtree is better than Maxtree, and En-DPtree is always superior to other competitive algorithms.
ISSN:2199-4536
2198-6053