Scholarlink

In this chapter, an efficient algorithm for modeling the operation of a deterministic decision tree solving the problem of realizability of decision rules is proposed and analyzed. In this problem, it is assumed that a system of decision rules is given and, for an arbitrary tuple of attribute values, it is required to determine whether there exists a rule realizable on this tuple, i.e., a rule whose left-hand side is true on this tuple. It is shown that the weighted depth of the modeled deterministic decision tree does not exceed the square of the minimum weighted depth of the nondeterministic decision tree solving the realizability problem.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient Modeling of Deterministic Decision Trees for Recognizing Realizable Decision Rules

  • 章节

  • 发表日期：

    2026年

查看全文
  • Kerven Durdymyradov,
  • Mikhail Moshkov,
  • Azimkhon Ostonov

摘要

In this chapter, an efficient algorithm for modeling the operation of a deterministic decision tree solving the problem of realizability of decision rules is proposed and analyzed. In this problem, it is assumed that a system of decision rules is given and, for an arbitrary tuple of attribute values, it is required to determine whether there exists a rule realizable on this tuple, i.e., a rule whose left-hand side is true on this tuple. It is shown that the weighted depth of the modeled deterministic decision tree does not exceed the square of the minimum weighted depth of the nondeterministic decision tree solving the realizability problem.