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

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE access Ročník 12; s. 164979 - 164988
Hlavní autoři:	Ostonov, Azimkhon, Moshkov, Mikhail
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!