{"id":"https://openalex.org/W2017734938","doi":"https://doi.org/10.1142/s0129054102001205","title":"SIZES OF ORDERED DECISION TREES","display_name":"SIZES OF ORDERED DECISION TREES","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2017734938","doi":"https://doi.org/10.1142/s0129054102001205","mag":"2017734938"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054102001205","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054102001205","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080214204","display_name":"Hans Zantema","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"HANS ZANTEMA","raw_affiliation_strings":["Department of Computer Science, Eindhoven University  of Technology, P.O. box 513, 5600 MB Eindhoven, The Netherlands","Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Eindhoven University  of Technology, P.O. box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"HANS L. BODLAENDER","raw_affiliation_strings":["Department of Computer Science, Utrecht University, Padualaan 14, P.O. box 80.089, 3508 TB Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, Padualaan 14, P.O. box 80.089, 3508 TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080214204"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.12573581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"03","first_page":"445","last_page":"458"},"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.991599977016449,"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.991599977016449,"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.979200005531311,"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"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9702000021934509,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7759836912155151},{"id":"https://openalex.org/keywords/incremental-decision-tree","display_name":"Incremental decision tree","score":0.6097660660743713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5504806637763977},{"id":"https://openalex.org/keywords/alternating-decision-tree","display_name":"Alternating decision tree","score":0.5325360298156738},{"id":"https://openalex.org/keywords/decision-tree-learning","display_name":"Decision tree learning","score":0.5292089581489563},{"id":"https://openalex.org/keywords/id3-algorithm","display_name":"ID3 algorithm","score":0.5246239304542542},{"id":"https://openalex.org/keywords/influence-diagram","display_name":"Influence diagram","score":0.49475759267807007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.442821204662323},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4389199912548065},{"id":"https://openalex.org/keywords/weighted-sum-model","display_name":"Weighted sum model","score":0.43225085735321045},{"id":"https://openalex.org/keywords/decision-stump","display_name":"Decision stump","score":0.42302316427230835},{"id":"https://openalex.org/keywords/decision-rule","display_name":"Decision rule","score":0.4227571487426758},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3826051950454712},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34729474782943726},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31399673223495483}],"concepts":[{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.7759836912155151},{"id":"https://openalex.org/C10229987","wikidata":"https://www.wikidata.org/wiki/Q17083028","display_name":"Incremental decision tree","level":4,"score":0.6097660660743713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5504806637763977},{"id":"https://openalex.org/C120136583","wikidata":"https://www.wikidata.org/wiki/Q4736414","display_name":"Alternating decision tree","level":5,"score":0.5325360298156738},{"id":"https://openalex.org/C5481197","wikidata":"https://www.wikidata.org/wiki/Q16766476","display_name":"Decision tree learning","level":3,"score":0.5292089581489563},{"id":"https://openalex.org/C183931066","wikidata":"https://www.wikidata.org/wiki/Q1653378","display_name":"ID3 algorithm","level":5,"score":0.5246239304542542},{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.49475759267807007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.442821204662323},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4389199912548065},{"id":"https://openalex.org/C188222737","wikidata":"https://www.wikidata.org/wiki/Q7979909","display_name":"Weighted sum model","level":4,"score":0.43225085735321045},{"id":"https://openalex.org/C141291300","wikidata":"https://www.wikidata.org/wiki/Q5249244","display_name":"Decision stump","level":5,"score":0.42302316427230835},{"id":"https://openalex.org/C84839998","wikidata":"https://www.wikidata.org/wiki/Q5249245","display_name":"Decision rule","level":2,"score":0.4227571487426758},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3826051950454712},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34729474782943726},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31399673223495483}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054102001205","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054102001205","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/6851ed45-0859-46a6-bcb0-58ffaf733da9","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/6851ed45-0859-46a6-bcb0-58ffaf733da9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zantema, H & Bodlaender, H L 2002, 'Sizes of ordered decision trees', International Journal of Foundations of Computer Science, vol. 13, no. 3, pp. 445-458. https://doi.org/10.1142/S0129054102001205","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:library.tue.nl:623455","is_oa":false,"landing_page_url":"http://repository.tue.nl/623455","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0129-0541","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/6851ed45-0859-46a6-bcb0-58ffaf733da9","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/6851ed45-0859-46a6-bcb0-58ffaf733da9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 13(3), 445 - 458. World Scientific","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3130568217","https://openalex.org/W2134772268","https://openalex.org/W2356463514","https://openalex.org/W3117017830","https://openalex.org/W1129665612","https://openalex.org/W4387869645","https://openalex.org/W2011862483","https://openalex.org/W4200233480","https://openalex.org/W3005679258","https://openalex.org/W3022567966"],"abstract_inverted_index":{"Decision":[0,19],"tables":[1,41],"provide":[2,21],"a":[3,22,110,124],"natural":[4],"framework":[5],"for":[6,25,127],"knowledge":[7,15],"acquisition":[8],"and":[9],"representation":[10],"in":[11,28,119],"the":[12,29,56,83,86,106],"area":[13,30],"of":[14,31,85,101],"based":[16],"information":[17],"systems.":[18],"trees":[20,50],"standard":[23],"method":[24],"inductive":[26],"inference":[27],"machine":[32],"learning.":[33],"In":[34],"this":[35],"paper":[36],"we":[37,71,122],"show":[38,72],"how":[39],"decision":[40,47,49,59,68,99,113,129],"can":[42,61],"be":[43,62],"considered":[44],"as":[45,109],"ordered":[46,67,98,112],"trees:":[48],"satisfying":[51],"an":[52,65,97,116],"ordering":[53],"restriction":[54],"on":[55],"nodes.":[57],"Every":[58],"tree":[60,100,114],"represented":[63],"by":[64],"equivalent":[66],"tree,":[69],"but":[70],"that":[73,95,104],"doing":[74],"so":[75],"may":[76],"exponentially":[77],"blow":[78],"up":[79],"sizes,":[80],"even":[81],"if":[82],"choice":[84],"order":[87],"is":[88,115],"left":[89],"free.":[90],"Our":[91],"main":[92],"result":[93,126],"states":[94],"finding":[96],"minimal":[102],"size":[103],"represents":[105],"same":[107],"function":[108],"given":[111],"NP-hard":[117],"problem;":[118],"earlier":[120],"work":[121],"obtained":[123],"similar":[125],"unordered":[128],"trees.":[130]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}