Related Experiment Video
Updated: Jul 12, 2025

Operant Protocols for Assessing the Cost-benefit Analysis During Reinforced Decision Making by Rodents
Published on: September 10, 2018
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed
Azimkhon Ostonov1, Mikhail Moshkov1
1Computer, Electrical and Mathematical Sciences & Engineering Division and Computational Bioscience Research Center, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia.
This study examines decision trees derived from decision tables. We analyze how attribute complexity impacts the minimum complexity of deterministic and nondeterministic decision trees.
Area of Science:
- Computer Science
- Decision Theory
- Algorithmic Complexity
Background:
- Decision tables are fundamental in representing complex decision-making processes.
- Understanding the complexity of decision trees is crucial for efficient algorithms.
- Previous research has explored decision tree optimization, but the impact of closed classes of decision tables requires further investigation.
Purpose of the Study:
- To analyze the relationship between attribute complexity and the minimum complexity of deterministic and nondeterministic decision trees.
- To investigate the correlation between the minimum complexity of deterministic and nondeterministic decision trees.
- To extend the understanding of decision table properties within closed classes.
Main Methods:
- Consideration of conventional decision tables belonging to classes closed under attribute removal and decision modification.
- Analysis of the dependence of decision tree complexity on attribute set complexity.
- Comparative study of the minimum complexity of deterministic versus nondeterministic decision trees.
Main Results:
- Established dependencies between the complexity of attribute sets and the minimum complexity of both deterministic and nondeterministic decision trees.
- Quantified the relationship between the minimum complexity of deterministic decision trees and their nondeterministic counterparts.
- Demonstrated that nondeterministic decision trees can represent sets of true decision rules covering all table rows.
Conclusions:
- The complexity of decision trees is significantly influenced by the complexity of the underlying attribute sets within closed classes of decision tables.
- The study provides insights into the trade-offs between deterministic and nondeterministic decision tree representations.
- Findings contribute to a deeper theoretical understanding of decision table analysis and decision tree construction.
More Related Videos
12:18A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
Published on: January 11, 2020
07:42An Automated T-maze Based Apparatus and Protocol for Analyzing Delay- and Effort-based Decision Making in Free Moving Rodents
Published on: August 2, 2018
Related Concept Videos
Decision Making: Traditional Method
First, a specific claim about the population parameter is decided based on the research question and is stated in a simple form. Further, an opposing statement to this claim is also stated. These statements can act as null and alternative hypotheses, out of which a null hypothesis would be a...
Contingency Table
Decision Making
Automatic decision-making is fast, intuitive, and relies on gut feelings...
Constraints and Statical Determinacy
Survival Tree
Building a Survival Tree
Constructing a...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility