Results 1 to 10 of about 9,741 (54)

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

open access: yesEntropy
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   +2 more sources

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

open access: yesEntropy, 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   +1 more source

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

open access: yesIEEE 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   +1 more source

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

open access: yesIEEE 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   +1 more source

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

open access: yesAnnals of computer science and information systems
Azimkhon Ostonov, Mikhail Moshkov
doaj   +1 more source

Home - About - Disclaimer - Privacy