Show simple item record

dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2021-04-04T07:58:43Z
dc.date.available2021-04-04T07:58:43Z
dc.date.issued2021-04
dc.date.submitted2020-07-09
dc.identifier.citationMoshkov, M. (2021). On the depth of decision trees over infinite 1-homogeneous binary information systems. Array, 100060. doi:10.1016/j.array.2021.100060
dc.identifier.issn2590-0056
dc.identifier.doi10.1016/j.array.2021.100060
dc.identifier.urihttp://hdl.handle.net/10754/668498
dc.description.abstractIn this paper, we study decision trees, which solve problems defined over a specific subclass of infinite information systems, namely: 1-homogeneous binary information systems. It is proved that the minimum depth of a decision tree (defined as a function on the number of attributes in a problem’s description) grows – in the worst case – logarithmically or linearly for each information system in this class. We consider a number of examples of infinite 1-homogeneous binary information systems, including one closely related to the decision trees constructed by the CART algorithm.
dc.description.sponsorshipResearch reported in this publication was supported by King Abdullah University of Science and Technology (KAUST). The author is thankful to Dr. Michal Mankowski for the helpful comments. The author gratefully acknowledges the useful suggestions of the anonymous reviewers.
dc.publisherElsevier BV
dc.relation.urlhttps://linkinghub.elsevier.com/retrieve/pii/S2590005621000084
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Array. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Array, [, , (2021-04)] DOI: 10.1016/j.array.2021.100060 . © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.titleOn the depth of decision trees over infinite 1-homogeneous binary information systems
dc.typeArticle
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.identifier.journalArray
dc.rights.embargodate2023-04
dc.eprint.versionPost-print
dc.identifier.pages100060
kaust.personMoshkov, Mikhail
dc.date.accepted2021-03-22
refterms.dateFOA2021-04-04T08:04:37Z


Files in this item

Thumbnail
Name:
On the depth of_1-s2.0-S2590005621000084-main.pdf
Size:
167.8Kb
Format:
PDF
Description:
Accepted manuscript

This item appears in the following Collection(s)

Show simple item record

NOTICE: this is the author’s version of a work that was accepted for publication in Array. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Array, [, , (2021-04)] DOI: 10.1016/j.array.2021.100060 . © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Except where otherwise noted, this item's license is described as NOTICE: this is the author’s version of a work that was accepted for publication in Array. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Array, [, , (2021-04)] DOI: 10.1016/j.array.2021.100060 . © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/