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 (...
Main Authors: | Azimkhon Ostonov, Mikhail Moshkov |
---|---|
格式: | Article |
語言: | English |
出版: |
IEEE
2024-01-01
|
叢編: | IEEE Access |
主題: | |
在線閱讀: | https://ieeexplore.ieee.org/document/10737049/ |
相似書籍
-
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
由: Azimkhon Ostonov, et al.
出版: (2024-06-01) -
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
由: Azimkhon Ostonov, et al.
出版: (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, et al.
出版: (2023-03-01)