Entropy-based greedy algorithm for decision trees using hypotheses
In this paper, we consider decision trees that use both conventional queries based on one
attribute each and queries based on hypotheses of values of all attributes. Such decision …
attribute each and queries based on hypotheses of values of all attributes. Such decision …
Decision rules derived from optimal decision trees with hypotheses
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 …
study, we also examine decision trees that handle additional queries based on hypotheses …
Optimization of decision trees with hypotheses for knowledge representation
In this paper, we consider decision trees that use two types of queries: queries based on one
attribute each and queries based on hypotheses about values of all attributes. Such decision …
attribute each and queries based on hypotheses about values of all attributes. Such decision …
On the depth of decision trees with hypotheses
M Moshkov - Entropy, 2022 - mdpi.com
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 …
investigate decision trees over infinite sets of binary attributes represented as infinite binary …
[图书][B] Decision Trees with Hypotheses
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 …
classifiers, as a means for knowledge representation, and as algorithms to solve various …
A Bi-criteria optimization model for adjusting the decision tree parameters
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 …
simplicity and self-explanatory nature. We study the optimization of the parameters of the …
Sorting by decision trees with hypotheses
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 …
and queries based on hypotheses about values of all attributes. Such decision trees are …
Exact learning for infinite families of concepts
M Moshkov - arXiv preprint arXiv:2201.08225, 2022 - arxiv.org
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 …
arbitrary infinite families of concepts each of which consists of an infinite set of elements and …
Greedy algorithms for decision trees with hypotheses
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 …
attribute and queries based on hypotheses about the values of all attributes. Such decision …
[PDF][PDF] Greedy Algorithms for Decision Trees with Hypotheses
B Zielosko - arXiv preprint arXiv:2203.08848, 2022 - researchgate.net
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 …
attribute and queries based on hypotheses about the values of all attributes. Such decision …