Results 241 to 250 of about 86,158 (257)
Some of the next articles are maybe not open access.
Deterministic and Nondeterministic Decision Trees for Rough Computing
Fundamenta Informaticae, 2000In the paper, infinite information systems are considered which are used in pattern recognition, discrete optimization, computational geometry. Depth and size of deterministic and nondeterministic decision trees over such information systems are studied. Two classes of infinite information systems are investigated.
openaire +2 more sources
Comparative Analysis of Deterministic and Nondeterministic Decision Trees
2020This book compares four parameters of problems in arbitrary information systems: complexity of problem representation and complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees for problem solving. Deterministic decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms.
openaire +2 more sources
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. Global Approach
Kerven Durdymyradov +2 more
openalex +2 more sources
2020
In this chapter, upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables.
openaire +1 more source
In this chapter, upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables.
openaire +1 more source
Deterministic and Nondeterministic Decision Trees for Decision Rule Systems from Closed Classes
Kerven Durdymyradov, Mikhail Moshkovopenaire +1 more source