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

Full description

Bibliographic Details

Published in:	Axioms Vol. 14; no. 11; p. 794
Main Authors:	Durdymyradov, Kerven, Moshkov, Mikhail
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.11.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!