Results 1 to 10 of about 6,358 (113)
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes [PDF]
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 +5 more sources
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes [PDF]
In 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 +6 more sources
The Hierarchical Classifier for COVID-19 Resistance Evaluation
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
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 +2 more sources
Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
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
Ostonov, Azimkhon, Moshkov, Mikhail
openaire +2 more sources
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
Determinising Parity Automata [PDF]
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the
Schewe, Sven, Varghese, Thomas
core +1 more source
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs [PDF]
This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs, deterministic or non-deterministic.
Buss, Sam, Das, Anupam, Knop, Alexander
core +4 more sources
Deterministic Automata for Unordered Trees [PDF]
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which ...
Boiret, Adrien +3 more
core +7 more sources
Generalizing input-driven languages: theoretical and practical benefits [PDF]
Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields.
Mandrioli, Dino, Pradella, Matteo
core +2 more sources

