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 (...
Главные авторы: | Azimkhon Ostonov, Mikhail Moshkov |
---|---|
Формат: | Статья |
Язык: | English |
Опубликовано: |
IEEE
2024-01-01
|
Серии: | IEEE Access |
Предметы: | |
Online-ссылка: | https://ieeexplore.ieee.org/document/10737049/ |
Схожие документы
-
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
по: Azimkhon Ostonov, и др.
Опубликовано: (2024-06-01) -
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
по: Azimkhon Ostonov, и др.
Опубликовано: (2023-10-01) -
Decision Trees for Binary Subword-Closed Languages
по: Mikhail Moshkov
Опубликовано: (2023-02-01) -
Decision trees for regular factorial languages
по: Mikhail Moshkov
Опубликовано: (2022-09-01) -
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
по: Mohammad Azad, и др.
Опубликовано: (2023-03-01)