论文信息 - Sorting by Decision Trees with Hypotheses (extended abstract)

Sorting by Decision Trees with Hypotheses (extended abstract)

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 similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. For n = 3, . . . , 6, we compare decision trees based on various combinations of attributes and hypotheses for sorting n pairwise different elements from linearly ordered set.

[1] Mohammad Azad,et al. Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses , 2021, Entropy.

[2] Mohammad Azad,et al. Minimizing Number of Nodes in Decision Trees with Hypotheses , 2021, KES.

[3] Mohammad Azad,et al. Optimization of Decision Trees with Hypotheses for Knowledge Representation , 2021, Electronics.

[4] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.

[5] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[6] Andrzej Skowron,et al. Rudiments of rough sets , 2007, Inf. Sci..

[7] Dana Angluin. Queries revisited , 2004, Theor. Comput. Sci..

[8] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .

[9] Theresa Beaubouef,et al. Rough Sets , 2019, Lecture Notes in Computer Science.

[10] Mohammad Azad,et al. Minimizing Depth of Decision Trees with Hypotheses , 2021, IJCRS.

[11] Fawaz Alsolami,et al. Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions , 2019, Intelligent Systems Reference Library.

[12] Igor Chikalov,et al. Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining , 2018, Intelligent Systems Reference Library.

[13] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.