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 (...
Prif Awduron: | Azimkhon Ostonov, Mikhail Moshkov |
---|---|
Fformat: | Erthygl |
Iaith: | English |
Cyhoeddwyd: |
IEEE
2024-01-01
|
Cyfres: | IEEE Access |
Pynciau: | |
Mynediad Ar-lein: | https://ieeexplore.ieee.org/document/10737049/ |
Eitemau Tebyg
-
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
gan: Azimkhon Ostonov, et al.
Cyhoeddwyd: (2024-06-01) -
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
gan: Azimkhon Ostonov, et al.
Cyhoeddwyd: (2023-10-01) -
Decision Trees for Binary Subword-Closed Languages
gan: Mikhail Moshkov
Cyhoeddwyd: (2023-02-01) -
Decision trees for regular factorial languages
gan: Mikhail Moshkov
Cyhoeddwyd: (2022-09-01) -
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
gan: Mohammad Azad, et al.
Cyhoeddwyd: (2023-03-01)