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 (...

Full description

Bibliographic Details

Published in:	IEEE access Vol. 12; pp. 164979 - 164988
Main Authors:	Ostonov, Azimkhon, Moshkov, Mikhail
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Boolean functions Closed classes of decision tables Complexity Complexity theory Data analysis Decision trees deterministic decision trees Fault diagnosis Greedy algorithms Object recognition Optimization Polynomials Risk management strongly nondeterministic decision trees
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!