Results 111 to 120 of about 3,458,167 (137)

AI-Derived Blood Biomarkers for Ovarian Cancer Diagnosis: Systematic Review and Meta-Analysis. [PDF]

J Med Internet Res
Xu HL, Li XY, Jia MQ, Ma QP, Zhang YH, Liu FH, Qin Y, Chen YH, Li Y, Chen XY, Xu YL, Li DR, Wang DD, Huang DH, Xiao Q, Zhao YH, Gao S, Qin X, Tao T, Gong TT, Wu QJ.   +20 more
europepmc   +1 more source

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

Some of the next articles are maybe not open access.

Related searches:

Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables

Intelligent Systems Reference Library, 2020
In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions.
Mikhail Moshkov
exaly   +2 more sources

The complexity of problems on probabilistic, nondeterministic, and alternating decision trees

Journal of the ACM, 1985
This work generalizes decision trees in order to study lower bounds on the running times of algorithms that allow probabilistic, nondeterministic, or alternating control. It is shown that decision trees that are allowed internal randomization (at the expense of introducing a small probability of error) run no faster asymptotically than ordinary ...
Martin Tompa
exaly   +4 more sources