Efficient Modeling of Deterministic Decision Trees for Recognition of Realizable Decision Rules: Bounds on Weighted Depth
Sign Up to like & getrecommendations! Published in 2025 at "Axioms"
DOI: 10.3390/axioms14110794
Abstract: 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… read more here.
Keywords: modeling deterministic; deterministic decision; efficient modeling; weighted depth ... See more keywords