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 this paper, based on the results of rough set theory, test theory, and exact learning, we
investigate decision trees over infinite sets of binary attributes represented as infinite binary …

In this research, we consider decision trees that incorporate standard queries with one
feature per query as well as hypotheses consisting of all features' values. These decision …

Decision trees are widely used in many areas of computer science and related fields as
classifiers, as a means for knowledge representation, and as algorithms to solve various …

Decision trees play a very important role in knowledge representation because of its
simplicity and self-explanatory nature. We study the optimization of the parameters of the …

In this paper, we consider decision trees that use both queries based on one attribute each
and queries based on hypotheses about values of all attributes. Such decision trees are …

In this paper, based on results of exact learning, test theory, and rough set theory, we study
arbitrary infinite families of concepts each of which consists of an infinite set of elements and …

We investigate at decision trees that incorporate both traditional queries based on one
attribute and queries based on hypotheses about the values of all attributes. Such decision …

In this chapter, we study the problem of recognition of monotone Boolean functions with n
variables, n= 2,…, 4, and the problem of sorting n pairwise different elements from linearly …

In this dissertation, the design and fabrication of deep-ultraviolet photodetectors were
investigated based on gallium oxide and its alloys, through the heterogeneous integration …