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

Celý popis

Podrobná bibliografia

Vydané v:	Axioms Ročník 14; číslo 11; s. 794
Hlavní autori:	Durdymyradov, Kerven, Moshkov, Mikhail
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.11.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!