Results 141 to 150 of about 3,823,341 (178)

Comparative Analysis of Deterministic and Nondeterministic Decision Trees

Intelligent Systems Reference Library, 2020
This 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.
Mikhail Moshkov
exaly   +4 more sources

Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes

Lecture Notes in Computer Science, 2023
Decision rules and decision trees are studied intensively in rough set theory. The following questions seem to be important for this theory: relations between decision trees and decision rule systems, and dependence of the complexity of decision trees ...
Azimkhon Ostonov, Mikhail Moshkov
exaly   +4 more sources

Deterministic and Nondeterministic Decision Trees for Recognition of Properties of Decision Rule Systems

Lecture Notes in Computer Science
This paper considers various problems of recognizing the properties of decision rule systems. Deterministic and nondeterministic decision trees are used as algorithms for solving them.
Mikhail Moshkov, Kerven Durdymyradov
exaly   +4 more sources

Deterministic and Nondeterministic Decision Trees for Recognition of All Realizable Decision Rules

Lecture Notes in Computer Science
The exploration of the relationships between decision trees and systems of decision rules is a significant research domain within computer science. While established methods exist for converting decision trees into systems of decision rules, the reverse ...
Mikhail Moshkov, Kerven Durdymyradov
exaly   +4 more sources

Deterministic and Nondeterministic Decision Trees for Decision Rule Systems from Closed Classes

Lecture Notes in Computer Science
The study of the relationships between decision rule systems and decision trees is of considerable interest in computer science. In this paper, we consider classes of decision rule systems that are closed under the operation of attribute removal.
Mikhail Moshkov, Kerven Durdymyradov
exaly   +3 more sources

Time and space complexity of deterministic and nondeterministic decision trees

Annals of Mathematics and Artificial Intelligence, 2022
AbstractIn this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finite number of attributes and a mapping ...
Mikhail Moshkov
exaly   +4 more sources

Optimal direct sum results for deterministic and randomized decision tree complexity [PDF]

Information Processing Letters, 2010
A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations.
Hartmut Klauck, Miklos Santha
exaly   +4 more sources