On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes [PDF]
Entropy, 2023 In this paper, we consider classes of conventional decision tables closed relative to the removal of attributes (columns) and changing decisions assigned to rows.
Azimkhon Ostonov, Mikhail Moshkov
doaj +9 more sources
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes [PDF]
EntropyIn this paper, we consider classes of decision tables with many-valued decisions closed under operations of the removal of columns, the changing of decisions, the permutation of columns, and the duplication of columns.
Azimkhon Ostonov, Mikhail Moshkov
doaj +11 more sources
Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes [PDF]
IEEE Access, 2023 This paper investigates classes of decision tables (DTs) with 0-1-decisions that are closed under the removal of attributes (columns) and changes to the assigned decisions to rows. For tables from any closed class (CC), the authors examine how the minimum complexity of deterministic decision trees (DDTs) depends on the minimum complexity of a strongly ...
Azimkhon Ostonov, Mikhail Moshkov
openaire +4 more sources
A Local Approach to Studying the Time and Space Complexity of Deterministic and Nondeterministic Decision Trees [PDF]
CoRR, 2023 In 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 associating a ...
Kerven Durdymyradov, Mikhail Moshkov
core +7 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
Comparison of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes [PDF]
CoRR, 2023 arXiv admin note: substantial text overlap with arXiv:2305.06093, arXiv:2304 ...
Azimkhon Ostonov, Mikhail Moshkov
core +4 more sources
IEEE AccessThis paper investigates classes of decision tables (DTs) with 0-1-decisions that are closed under the removal of attributes (columns) and changes to the assigned decisions to rows.
Azimkhon Ostonov, Mikhail Moshkov
doaj +3 more sources
The Hierarchical Classifier for COVID-19 Resistance Evaluation
Data, 2021 Finding dependencies in the data requires the analysis of relations between dozens of parameters of the studied process and hundreds of possible sources of influence on this process.
Nataliya Shakhovska +2 more
doaj +1 more source
Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
CoRR, 2023 In this paper, we consider classes of decision tables with 0-1-decisions closed relative to removal of attributes (columns) and changing decisions assigned to rows. For tables from an arbitrary closed class, we study the dependence of the minimum complexity of deterministic decision trees on various parameters of the tables: the minimum complexity of a
Azimkhon Ostonov, Mikhail Moshkov
openaire +2 more sources
International Journal of Disaster Risk Science, 2020 This article focuses on decision making for retrofit investment of road networks in order to alleviate severe consequences of roadside tree blowdown during tropical cyclones.
Fuyu Hu, Saini Yang, Russell G. Thompson
doaj +1 more source