Results 121 to 130 of about 3,458,167 (137)

Deterministic and Nondeterministic Decision Trees for Rough Computing

Fundamenta Informaticae, 2000
In 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.
Mikhail Moshkov
exaly   +4 more sources

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

Communications in Computer and Information Science
This paper examines types of decision tables with many-valued decisions that are closed under the attribute (columns) removal and changes in the sets of decisions assigned to rows.
Azimkhon Ostonov, Mikhail Moshkov
exaly   +3 more sources

Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. Global Approach

Studies in Big Data
Azimkhon Ostonov, Mikhail Moshkov, Kerven Durdymyradov   +2 more
exaly   +2 more sources

Probabilistic, Nondeterministic, and Alternating Decision Trees

Proceedings of the fourteenth annual ACM symposium on Theory of computing, 1982
This work generalizes decision trees in order to model algorithms which allow probabilistic, nondeterministic, or alternating control. Two geometric techniques for proving lower bounds on the time required by ordinary decision trees (Dobkin and Lipton's -&-ldquo;region-counting-&-rdquo; technique as applied to the knapsack and element uniqueness ...
Udi Manber, Martin Tompa
openaire   +2 more sources

Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes

Studies in Big Data
Azimkhon Ostonov, Mikhail Moshkov, Kerven Durdymyradov   +2 more
exaly   +2 more sources

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

Studies in Big Data
Azimkhon Ostonov, Mikhail Moshkov, Kerven Durdymyradov   +2 more
exaly   +2 more sources

Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables with 0-1-Decisions from Closed Classes

Studies in Big Data
Azimkhon Ostonov, Mikhail Moshkov, Kerven Durdymyradov   +2 more
exaly   +2 more sources

COMPARITIVE ANALYSIS OF DETERMINISTIC AND NONDETERMINISTIC DECISION TREE COMPLEXITY. GLOBAL APPROACH

Fundamenta Informaticae, 1996
We study the relationships between the complexity of a task description and the minimal complexity of deterministic and nondeterministic decision trees solving this task. We investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.
openaire   +2 more sources

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

Decision trees (DTRs) and decision rules are extensively examined and applied in various domains of computer science. The theory of DTRs and rules highlights several crucial inquiries, such as how the complexity of deterministic decision trees (DDTRs ...
Azimkhon Ostonov, Mikhail Moshkov
openaire   +3 more sources

Time and Space Complexity of Deterministic and Nondeterministic Decision Trees: Local Approach

2023 IEEE International Conference on Big Data (BigData), 2023
Kerven Durdymyradov, Mikhail Moshkov
openaire   +2 more sources