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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Entropy (Basel, Switzerland) Jg. 26; H. 6; S. 519
Hauptverfasser:	Ostonov, Azimkhon, Moshkov, Mikhail
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Switzerland MDPI AG 17.06.2024 MDPI
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!