5 citations · 16 across the 13 of their papers we have counts for
13 papers
Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
Azimkhon Ostonov, Mikhail Moshkov
In this paper, we consider classes of decision tables with 0-1-decisions closed relative to removal of attributes (columns) and changing decisions assigned to rows. For tables from…
Construction of Decision Trees and Acyclic Decision Graphs from Decision Rule Systems
Kerven Durdymyradov, Mikhail Moshkov
Decision trees and systems of decision rules are widely used as classifiers, as a means for knowledge representation, and as algorithms. They are among the most interpretable model…
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
Azimkhon Ostonov, Mikhail Moshkov
In this paper, we consider classes of decision tables with many-valued decisions closed under operations of removal of columns, changing of decisions, permutation of columns, and d…
Bounds on Depth of Decision Trees Derived from Decision Rule Systems
Kerven Durdymyradov, Mikhail Moshkov
Systems of decision rules and decision trees are widely used as a means for knowledge representation, as classifiers, and as algorithms. They are among the most interpretable model…
Diagnosis of Constant Faults in Switching Networks
Mikhail Moshkov
In this paper, we study decision trees for diagnosis of constant faults in switching networks. Each constant fault consists in assigning Boolean constants to some edges of the netw…
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…
Decision trees for binary subword-closed languages
Mikhail Moshkov
In this paper, we study arbitrary subword-closed languages over the alphabet (binary subword-closed languages). For the set of words of the length belonging to…
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…
Rough analysis of computation trees
Mikhail Moshkov
This paper deals with computation trees over an arbitrary structure consisting of a set along with collections of functions and predicates that are defined on it. It is devoted to…