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

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 (...

Cijeli opis

Bibliografski detalji
Glavni autori: Azimkhon Ostonov, Mikhail Moshkov
Format: Članak
Jezik:English
Izdano: IEEE 2024-01-01
Serija:IEEE Access
Teme:
Online pristup:https://ieeexplore.ieee.org/document/10737049/

Slični predmeti