{"id":"https://openalex.org/W4415974426","doi":"https://doi.org/10.1016/j.procs.2025.10.093","title":"Comparison of Complexity of Regular and Oblivious Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes","display_name":"Comparison of Complexity of Regular and Oblivious Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974426","doi":"https://doi.org/10.1016/j.procs.2025.10.093"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.10.093","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.093","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.10.093","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037876431","display_name":"Azimkhon Ostonov","orcid":"https://orcid.org/0000-0001-5763-9751"},"institutions":[{"id":"https://openalex.org/I71920554","display_name":"King Abdullah University of Science and Technology","ror":"https://ror.org/01q3tbs38","country_code":"SA","type":"education","lineage":["https://openalex.org/I71920554"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"Azimkhon Ostonov","raw_affiliation_strings":["Computer, Electrical and Mathematical Sciences & Engineering Division King Abdullah University of Science and Technology (KAUST) Thuwal 23955-6900, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer, Electrical and Mathematical Sciences & Engineering Division King Abdullah University of Science and Technology (KAUST) Thuwal 23955-6900, Saudi Arabia","institution_ids":["https://openalex.org/I71920554"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009085292","display_name":"Mikhail Moshkov","orcid":"https://orcid.org/0000-0003-0085-9483"},"institutions":[{"id":"https://openalex.org/I71920554","display_name":"King Abdullah University of Science and Technology","ror":"https://ror.org/01q3tbs38","country_code":"SA","type":"education","lineage":["https://openalex.org/I71920554"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Mikhail Moshkov","raw_affiliation_strings":["Computer, Electrical and Mathematical Sciences & Engineering Division King Abdullah University of Science and Technology (KAUST) Thuwal 23955-6900, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer, Electrical and Mathematical Sciences & Engineering Division King Abdullah University of Science and Technology (KAUST) Thuwal 23955-6900, Saudi Arabia","institution_ids":["https://openalex.org/I71920554"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037876431"],"corresponding_institution_ids":["https://openalex.org/I71920554"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40831629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"6233","last_page":"6242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.7444999814033508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.7444999814033508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.025100000202655792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.024700000882148743,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.6622999906539917},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5831000208854675},{"id":"https://openalex.org/keywords/reduct","display_name":"Reduct","score":0.5687000155448914},{"id":"https://openalex.org/keywords/weighted-sum-model","display_name":"Weighted sum model","score":0.5029000043869019},{"id":"https://openalex.org/keywords/optimal-decision","display_name":"Optimal decision","score":0.4925999939441681},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.48089998960494995},{"id":"https://openalex.org/keywords/decision-tree-model","display_name":"Decision tree model","score":0.4796999990940094},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4562000036239624},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4408000111579895},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43290001153945923}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.664900004863739},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.6622999906539917},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5831000208854675},{"id":"https://openalex.org/C69177213","wikidata":"https://www.wikidata.org/wiki/Q12880812","display_name":"Reduct","level":3,"score":0.5687000155448914},{"id":"https://openalex.org/C188222737","wikidata":"https://www.wikidata.org/wiki/Q7979909","display_name":"Weighted sum model","level":4,"score":0.5029000043869019},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.4925999939441681},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.48089998960494995},{"id":"https://openalex.org/C56289965","wikidata":"https://www.wikidata.org/wiki/Q5249246","display_name":"Decision tree model","level":3,"score":0.4796999990940094},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4562000036239624},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4408000111579895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C172967692","wikidata":"https://www.wikidata.org/wiki/Q747762","display_name":"Decision table","level":3,"score":0.4235999882221222},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41609999537467957},{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.40540000796318054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.374099999666214},{"id":"https://openalex.org/C141291300","wikidata":"https://www.wikidata.org/wiki/Q5249244","display_name":"Decision stump","level":5,"score":0.3628999888896942},{"id":"https://openalex.org/C120136583","wikidata":"https://www.wikidata.org/wiki/Q4736414","display_name":"Alternating decision tree","level":5,"score":0.3549000024795532},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33820000290870667},{"id":"https://openalex.org/C5481197","wikidata":"https://www.wikidata.org/wiki/Q16766476","display_name":"Decision tree learning","level":3,"score":0.3327000141143799},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C10229987","wikidata":"https://www.wikidata.org/wiki/Q17083028","display_name":"Incremental decision tree","level":4,"score":0.3082999885082245},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C186116695","wikidata":"https://www.wikidata.org/wiki/Q5249226","display_name":"Decision analysis","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C84839998","wikidata":"https://www.wikidata.org/wiki/Q5249245","display_name":"Decision rule","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2720000147819519},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.266400009393692},{"id":"https://openalex.org/C59594135","wikidata":"https://www.wikidata.org/wiki/Q5249242","display_name":"Decision model","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25589999556541443},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.10.093","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.093","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.10.093","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.093","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322320","display_name":"King Abdullah University of Science and Technology","ror":"https://ror.org/01q3tbs38"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1494581921","https://openalex.org/W1496913341","https://openalex.org/W1553701556","https://openalex.org/W1938486431","https://openalex.org/W1992971635","https://openalex.org/W2012496360","https://openalex.org/W2061534693","https://openalex.org/W2143451122","https://openalex.org/W2148239836","https://openalex.org/W2211993631","https://openalex.org/W2929158273"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,73,113,152,181],"paper,":[2],"classes":[3],"of":[4,21,26,37,41,49,57,108,112,122,126,142,146,163,177],"decision":[5,14,43,51,109,129,133,149,153,169,193],"tables":[6,31],"with":[7,17,139],"many-valued":[8],"decisions":[9,27],"(also":[10],"known":[11],"as":[12,85],"multi-labeled":[13],"tables)":[15],"closed":[16,137],"respect":[18],"to":[19,173,191],"deletion":[20],"attributes":[22],"(columns)":[23],"and":[24,105],"change":[25],"are":[28],"considered.":[29],"For":[30],"from":[32,78,135],"these":[33],"classes,":[34],"the":[35,38,46,55,70,97,103,120,123,140,143,160,174],"dependence":[36,74],"minimum":[39,47,124,144,161,175],"complexity":[40,48,100,125,145,162,176],"regular":[42,128],"trees":[44],"on":[45,59],"oblivious":[50,148,165,192],"trees,":[52],"in":[53,116,119],"which":[54],"order":[56],"queries":[58],"attribute":[60],"values":[61],"is":[62,64,67,75,94,156,171],"predetermined,":[63],"studied.":[65],"It":[66,155],"proved":[68],"that":[69,159],"function":[71],"describing":[72],"either":[76],"bounded":[77,99],"above":[79],"by":[80],"a":[81,86,127,132,136,168,178],"constant":[82],"or":[83,88],"grows":[84,89],"logarithm,":[87],"almost":[90],"linearly.":[91],"This":[92,183],"result":[93],"valid":[95],"for":[96,131,151,167,180,188],"so-called":[98],"measures,":[101],"including":[102],"depth":[104,107],"weighted":[106],"trees.":[110,194],"Motivation":[111],"work":[114],"constitutes":[115],"analyzing":[117],"growth":[118,141],"worst-case":[121],"tree":[130,150,166],"table":[134,170],"class":[138],"an":[147,164],"table.":[154,182],"also":[157],"shown":[158],"equal":[172],"reduct":[179],"finding":[184],"can":[185],"be":[186],"useful":[187],"applications":[189],"related":[190]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-06T00:00:00"}