Conventional decision trees use queries each of which is based on one attribute. In this
study, we also examine decision trees that handle additional queries based on hypotheses …

In the paper, an approach for decision rules construction is proposed. It is studied from the
point of view of the supervised machine learning task, ie, classification, and from the point of …

This paper is devoted to the consideration of software system Dagger created in KAUST.
This system is based on extensions of dynamic programming. It allows sequential …

This paper is devoted to the study of an extension of dynamic programming approach which
allows optimization of partial decision rules relative to the length or coverage. We introduce …

Relationships Between Length and Coverage of Decision Rules 1. Introduction Page 1
Fundamenta Informaticae 129 (2014) 1–13 1 DOI 10.3233/FI-2014-956 IOS Press …

This chapter is devoted to the study of an extension of dynamic programming approach
which allows optimization of approximate decision rules relative to the length and coverage …

In this chapter, we propose dynamic programming algorithms for the construction of decision
trees with minimum depth and decision trees with minimum number of working (nonterminal) …

The paper is devoted to the study of an extension of dynamic programming approach which
allows sequential optimization of approximate decision rules relative to length, coverage …

Optimality of decision rules (patterns) can be measured in many ways. One of these is
referred to as length. Length signifies the number of terms in a decision rule and is optimally …

Authors present algorithms for optimization of inhibitory rules relative to the length and
coverage. Inhibitory rules have a relation “attribute≠ value” on the right-hand side. The …