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: | , |
|---|---|
| Đị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/ |