Efficient Modeling of Deterministic Decision Trees for Recognition of Realizable Decision Rules: Bounds on Weighted Depth

In this paper, an efficient algorithm for modeling the operation of a DDT (Deterministic Decision Tree) solving the problem of realizability of DRs (Decision Rules) is proposed and analyzed. For this problem, it is assumed that a DRS (Decision Rule System) is given; for an arbitrary tuple of feature...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Axioms Jg. 14; H. 11; S. 794
Hauptverfasser:	Durdymyradov, Kerven, Moshkov, Mikhail
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.11.2025
Schlagworte:	Algorithms Analysis Decision trees Decision-making deterministic decision tree Modelling nondeterministic decision tree Realizability system of decision rules weighted depth United States
ISSN:	2075-1680, 2075-1680
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!