{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:11:30Z","timestamp":1759331490387,"version":"build-2065373602"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1109\/access.2025.3610956","type":"journal-article","created":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T17:32:08Z","timestamp":1758130328000},"page":"164464-164473","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of Complexity of Regular Versus Oblivious Decision Trees for Decision Tables With Many-Valued Decisions From Closed Classes"],"prefix":"10.1109","volume":"13","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":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614316"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28667-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75197-7"},{"key":"ref4","volume-title":"Programs From Decision Tables","volume":"19","author":"Humby","year":"1973"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4"},{"volume-title":"Decision Tables: Theory and Practice","year":"1971","author":"Pollack","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/SMPAI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11427834_12"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20995-6","volume-title":"Combinatorial Machine Learning: A Rough Set Approach","volume":"360","author":"Moshkov","year":"2011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2019-1785"},{"volume-title":"Classification and Regression Trees, Wadsworth and Brooks","year":"1984","author":"Breiman","key":"ref11"},{"key":"ref12","first-page":"354","article-title":"On efficient construction of decision trees from large databases","volume-title":"Proc. 2nd Int.Conf. Rough Sets Current Trends Comput.","author":"Nguyen"},{"volume-title":"C4.5: Programs for Machine Learning","year":"1993","author":"Quinlan","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52705-1_28"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0015"},{"key":"ref16","first-page":"1071","article-title":"Oblivious decision trees, graphs, and top-down pruning","volume-title":"Proc. 14th Int. Joint Conf. Artif. Intell.","author":"Kohavi"},{"key":"ref17","first-page":"113","article-title":"Oblivious decision trees and abstract cases","volume-title":"Proc. Work. Notes AAAI94 Workshop Case-Based Reasoning","author":"Langley"},{"key":"ref18","article-title":"Neural oblivious decision ensembles for deep learning on tabular data","author":"Popov","year":"2019","journal-title":"arXiv:1909.06312"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.843247"},{"key":"ref20","article-title":"CatBoost: Unbiased boosting with categorical features","author":"Prokhorenkova","year":"2017","journal-title":"arXiv:1706.09516"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1810.11363"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91839-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00186-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.06.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43505-2_21"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7975-9_21"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3022735"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5121\/ijaia.2014.5403"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(81)90023-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-71586-0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-92744-7_1"},{"key":"ref32","first-page":"3","article-title":"Comparison of complexity of regular and oblivious decision trees for decision tables with many-valued decisions from closed classes","volume-title":"Proc. 29th Int. Conf. Knowl.-Based Intell. Inf. Eng. Syst.","author":"Ostonov"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.30"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/PSCT.1987.10319267"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125350"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3390\/e25101411"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.03.002"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11168224.pdf?arnumber=11168224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T12:34:28Z","timestamp":1759235668000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11168224\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3610956","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}