Notice
This is not the latest version of this item. The latest version can be found at: https://repository.kaust.edu.sa/handle/10754/668498
On the depth of decision trees over infinite 1-homogeneous binary information systems
| dc.contributor.author | Moshkov, Mikhail | |
| dc.date.accessioned | 2021-04-04T07:58:43Z | |
| dc.date.available | 2021-04-04T07:58:43Z | |
| dc.date.issued | 2021-04 | |
| dc.date.submitted | 2020-07-09 | |
| dc.identifier.citation | Moshkov, 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.issn | 2590-0056 | |
| dc.identifier.doi | 10.1016/j.array.2021.100060 | |
| dc.identifier.uri | http://hdl.handle.net/10754/668498.1 | |
| dc.description.abstract | In 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.sponsorship | Research 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.publisher | Elsevier BV | |
| dc.relation.url | https://linkinghub.elsevier.com/retrieve/pii/S2590005621000084 | |
| dc.rights | 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/ | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.title | On the depth of decision trees over infinite 1-homogeneous binary information systems | |
| dc.type | Article | |
| dc.contributor.department | Applied Mathematics and Computational Science Program | |
| dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | |
| dc.contributor.department | Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group | |
| dc.identifier.journal | Array | |
| dc.rights.embargodate | 2023-04 | |
| dc.eprint.version | Post-print | |
| dc.identifier.pages | 100060 | |
| kaust.person | Moshkov, Mikhail | |
| dc.date.accepted | 2021-03-22 | |
| refterms.dateFOA | 2021-04-04T08:04:37Z |
Files in this item
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)
-
Articles
-
Applied Mathematics and Computational Science Program
For more information visit: https://cemse.kaust.edu.sa/amcs -
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
For more information visit: https://cemse.kaust.edu.sa/
![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/](/themes/OR//images/creativecommons/cc-by-nc-nd.png)
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/