Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes

In this paper, we consider classes of decision tables with many-valued decisions closed under operations of the removal of columns, the changing of decisions, the permutation of columns, and the duplication of columns. We study relationships among three parameters of these tables: the complexity of...

Celý popis

Podrobná bibliografie

Vydáno v:	Entropy (Basel, Switzerland) Ročník 26; číslo 6; s. 519
Hlavní autoři:	Ostonov, Azimkhon, Moshkov, Mikhail
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Switzerland MDPI AG 17.06.2024 MDPI
Témata:	Algorithms Boolean closed classes of decision tables Complexity Data analysis Decision trees deterministic decision trees Fault diagnosis Information systems nondeterministic decision trees Permutations deterministic decision trees nondeterministic decision trees closed classes of decision tables
ISSN:	1099-4300, 1099-4300
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!