Results 181 to 190 of about 166,222,356 (196)

Greedy Algorithm for Construction of Deterministic Decision Trees for Conventional Decision Tables from Closed Classes

Lecture Notes in Computer Science
This paper examines specific classes of conventional decision tables (DTs) that are closed under operations of attribute (column) removal and decision modifications assigned to rows.
Azimkhon Ostonov, Mikhail Moshkov
exaly   +3 more sources

On Complexity of Decision Trees for Decision Tables from Closed Classes

In this thesis, we consider classes of decision tables closed under operations of removal of attributes (columns) and changing of decisions and sometimes some other operations and study for the tables from these classes relationships among the minimum complexity of deterministic and nondeterministic decision trees and the complexity of the set of ...
Ostonov, Azimkhon
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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

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

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

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
openaire   +2 more sources

Three Problems for Decision Rule Systems from Closed Classes

Axioms
The study of the relationships between DRSs (Decision Rule Systems) and DTs (Decision Trees) is of considerable interest in computer science. In this paper, we consider classes of DRSs that are closed under specific operations.
Mikhail Moshkov, Kerven Durdymyradov
exaly   +2 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   +2 more sources

On Complexity of Deterministic and Nondeterministic Decision Trees Fordecision Tables from Closed Classes

2023
Azimkhon Ostonov, Mikhail Moshkov
openaire   +1 more source