Results 1 to 10 of about 166,222,356 (196)

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

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   +8 more sources

Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes [PDF]

Annals of computer science and information systems
In this paper, we consider classes of decision tables closed under removal of attributes (columns) and changing of decisions attached to rows. For decision tables from closed classes, we study lower bounds on the minimum cardinality of reducts, which are minimal sets of attributes that allow us to recognize, for a given row, the decision attached to it.
Azimkhon Ostonov, Mikhail Moshkov
doaj   +8 more sources

Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes

Entropy
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   +10 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

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

Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes

IEEE Access
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.
Azimkhon Ostonov, Mikhail Moshkov
doaj   +3 more sources

Comparison of Complexity of Regular Versus Oblivious Decision Trees for Decision Tables With Many-Valued Decisions From Closed Classes

IEEE Access
In this work, we examine decision table (DTA) classes that are closed in terms of decision modification (i.e., the sets of decisions) and attribute deletion (i.e., columns).
Azimkhon Ostonov, Mikhail Moshkov
doaj   +3 more sources

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

Closed Classes of Binary Complete Decision Tables with Many-Valued Decisions

Journal of Intelligent Learning Systems and Applications
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov   +2 more
openaire   +1 more source

TA-BI: A Formal Observation-to-Decision Architecture for Trust-Aware Routing Support in Wireless and Mobile Wireless Sensor Networks. [PDF]

Sensors (Basel)
Jabłoński W, Krenc K, Kawalec A.
europepmc   +1 more source