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 (...
Những tác giả chính: | Azimkhon Ostonov, Mikhail Moshkov |
---|---|
Định dạng: | Bài viết |
Ngôn ngữ: | English |
Được phát hành: |
IEEE
2024-01-01
|
Loạt: | IEEE Access |
Những chủ đề: | |
Truy cập trực tuyến: | https://ieeexplore.ieee.org/document/10737049/ |
Những quyển sách tương tự
-
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
Bằng: Azimkhon Ostonov, et al.
Được phát hành: (2024-06-01) -
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
Bằng: Azimkhon Ostonov, et al.
Được phát hành: (2023-10-01) -
Decision Trees for Binary Subword-Closed Languages
Bằng: Mikhail Moshkov
Được phát hành: (2023-02-01) -
Decision trees for regular factorial languages
Bằng: Mikhail Moshkov
Được phát hành: (2022-09-01) -
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
Bằng: Mohammad Azad, et al.
Được phát hành: (2023-03-01)