{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:23:41Z","timestamp":1740169421309,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3487514","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T17:39:46Z","timestamp":1730137186000},"page":"164979-164988","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5763-9751","authenticated-orcid":false,"given":"Azimkhon","family":"Ostonov","sequence":"first","affiliation":[{"name":"Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0085-9483","authenticated-orcid":false,"given":"Mikhail","family":"Moshkov","sequence":"additional","affiliation":[{"name":"Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/11427834_12"},{"volume-title":"Classification and Regression Trees","author":"Breiman","doi-asserted-by":"crossref","key":"ref2","DOI":"10.1201\/9781315139470"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/978-3-030-41728-4"},{"volume-title":"C4.5: Programs for Machine Learning","year":"1993","author":"Quinlan","key":"ref4"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1142\/6604","volume-title":"Data MiningWith Decision Trees\u2014Theory and Applications","volume":"69","author":"Rokach","year":"2007"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/BF02614316"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/69.842268"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/978-3-540-75197-7"},{"key":"ref9","volume-title":"Rough Sets\u2013Theoretical Aspects of Reasoning About Data","volume":"9","author":"Pawlak","year":"1991"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.ins.2006.06.003"},{"volume-title":"Interpretable Machine Learning. A Guide for Making Black Box Models Explainable","year":"2022","author":"Molnar","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.3233\/FI-1995-2231"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/0306-4379(81)90023-5"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1515\/9781400882366"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"ref16","first-page":"78","article-title":"On depth of conditional tests for tables from closed classes","volume-title":"Combinatorial-Algebraic and Probabilistic Methods of Discrete Analysis","author":"Moshkov","year":"1989"},{"issue":"6","key":"ref17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.3390\/e26060519","article-title":"Comparative analysis of deterministic and nondeterministic decision trees for decision tables from closed classes","volume":"26","author":"Ostonov","year":"2024","journal-title":"Entropy"},{"issue":"10","key":"ref18","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.3390\/e25101411","article-title":"On complexity of deterministic and nondeterministic decision trees for conventional decision tables from closed classes","volume":"25","author":"Ostonov","year":"2023","journal-title":"Entropy"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1007\/978-3-031-65665-1_11"},{"key":"ref20","first-page":"131","article-title":"Conditional tests","volume-title":"Problemy Kibernetiki","volume":"40","author":"Moshkov","year":"1983"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10737049.pdf?arnumber=10737049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T17:05:26Z","timestamp":1732727126000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10737049\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3487514","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}