Name:
1-s2.0-S1877050921015118-main.pdf
Size:
397.9Kb
Format:
PDF
Description:
Publisher's version
Type
ArticleKAUST Department
Applied Mathematics and Computational Science ProgramComputer, Electrical and Mathematical Science and Engineering (CEMSE) Division
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Date
2021Permanent link to this record
http://hdl.handle.net/10754/672059
Metadata
Show full item recordAbstract
In this paper, we consider decision trees that use both conventional queries based on one attribute each and queries based on hypotheses about values of all attributes. This approach is similar to one studied in exact learning, where membership and equivalence queries are considered. We propose dynamic programming algorithms for the minimization of the number of nodes in such decision trees and discuss results of computer experiments.Citation
Azad, M., Chikalov, I., Hussain, S., & Moshkov, M. (2021). Minimizing Number of Nodes in Decision Trees with Hypotheses. Procedia Computer Science, 192, 232–240. doi:10.1016/j.procs.2021.08.024Sponsors
Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST). The authors are greatly indebted to anonymous reviewers for useful comments and suggestions.Publisher
Elsevier BVJournal
Procedia Computer ScienceAdditional Links
https://linkinghub.elsevier.com/retrieve/pii/S1877050921015118ae974a485f413a2113503eed53cd6c53
10.1016/j.procs.2021.08.024
Scopus Count
Except where otherwise noted, this item's license is described as This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0)
Peer-review under responsibility of the scientific committee of KES International.