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/

相似書籍