2 citations · 8 across the 7 of their papers we have counts for
7 papers
Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting
Mohammad Azad, Igor Chikalov, Shahid Hussain +2
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…
Greedy Algorithms for Decision Trees with Hypotheses
Mohammad Azad, Igor Chikalov, Shahid Hussain +2
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…
Exact learning for infinite families of concepts
Mikhail Moshkov
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…
Exact learning and test theory
Mikhail Moshkov
In this paper, based on results of exact learning and test theory, we study arbitrary infinite binary information systems each of which consists of an infinite set of elements and…
Decision trees for regular factorial languages
Mikhail Moshkov
In this paper, we study arbitrary regular factorial languages over a finite alphabet . For the set of words of the length belonging to a regular factorial language $L…
Time and space complexity of deterministic and nondeterministic decision trees
Mikhail Moshkov
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attribu…