Skip to main content

Optimization of Decision Trees with Hypotheses for Knowledge Representation

Author name : MOHAMMAD MOHIUDDIN AZAD
Publication Date : 2021-06-30
Journal Name : Electronics-MDPI

Abstract

In this paper, we consider decision trees that use two types of queries: queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to the ones studied in exact learning, where membership and equivalence queries are allowed. We present dynamic programming algorithms for minimization of the depth and number of nodes of above decision trees and discuss results of computer experiments on various data sets and randomly generated Boolean functions. Decision trees with hypotheses generally have less complexity, i.e., they are more understandable and more suitable as a means for knowledge representation.

Keywords

Decision Trees

Publication Link

https://www.mdpi.com/2079-9292/10/13/1580

Block_researches_list_suggestions

Suggestions to read

HIDS-IoMT: A Deep Learning-Based Intelligent Intrusion Detection System for the Internet of Medical Things
Ahlem . Harchy Ep Berguiga
Generalized first approximation Matsumoto metric
AMR SOLIMAN MAHMOUD HASSAN
Structure–Performance Relationship of Novel Azo-Salicylaldehyde Disperse Dyes: Dyeing Optimization and Theoretical Insights
EBTSAM KHALEFAH H ALENEZY
“Synthesis and Characterization of SnO₂/α-Fe₂O₃, In₂O₃/α-Fe₂O₃, and ZnO/α-Fe₂O₃ Thin Films: Photocatalytic and Antibacterial Applications”
Asma Arfaoui
Contact