Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes.

Entropy (Basel)

Computer, Electrical and Mathematical Sciences & Engineering Division and Computational Bioscience Research Center, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia.

Published: June 2024

In this paper, we consider classes of decision tables with many-valued decisions closed under operations of the removal of columns, the changing of decisions, the permutation of columns, and the duplication of columns. We study relationships among three parameters of these tables: the complexity of a decision table (if we consider the depth of the decision trees, then the complexity of a decision table is the number of columns in it), the minimum complexity of a deterministic decision tree, and the minimum complexity of a nondeterministic decision tree. We consider the rough classification of functions characterizing relationships and enumerate all possible seven types of relationships.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11202716PMC
http://dx.doi.org/10.3390/e26060519DOI Listing

Publication Analysis

Top Keywords

decision
8
nondeterministic decision
8
decision trees
8
decision tables
8
complexity decision
8
decision table
8
minimum complexity
8
decision tree
8
comparative analysis
4
analysis deterministic
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!