{"id":"https://openalex.org/W7208316708","doi":null,"title":"Branches: Efficiently seeking optimal sparse decision trees via AO*","display_name":"Branches: Efficiently seeking optimal sparse decision trees via AO*","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7208316708"},"language":"en","primary_location":{"id":"pmh:oai:researchcommons.waikato.ac.nz:10289/18421","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/10289/18421","pdf_url":null,"source":{"id":"https://openalex.org/S7407063277","display_name":"Research Commons (University of Waikato)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"The 42nd International Conference on Machine Learning (ICML 2025)","raw_type":"Conference Contribution"},"volume":null,"type":"conference-paper","indexed_in":[],"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/A5046493789","display_name":"Ayman Chaouki","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chaouki, Ayman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055668668","display_name":"Jesse Read","orcid":"https://orcid.org/0000-0002-1013-6724","observed_orcids":["https://orcid.org/0000-0002-1013-6724"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Read, Jesse","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126217309","display_name":"Albert Bifet","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bifet, Albert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70818039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9301999807357788,"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"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9301999807357788,"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/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.016200000420212746,"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"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.009800000116229057,"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-induction","display_name":"decision tree induction","score":0.7580000162124634},{"id":"https://openalex.org/keywords/optimality-guarantees","display_name":"optimality guarantees","score":0.6759999990463257},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.5619999766349792},{"id":"https://openalex.org/keywords/model-interpretability","display_name":"model interpretability","score":0.7620000243186951},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6036999821662903},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5672000050544739},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5604000091552734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4503999948501587},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.424699991941452},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4203999936580658},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4115999937057495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40139999985694885},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.38690000772476196},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3603000044822693},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3382999897003174},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3377000093460083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32199999690055847},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.2831000089645386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28060001134872437},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2712000012397766},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27070000767707825}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:researchcommons.waikato.ac.nz:10289/18421","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/10289/18421","pdf_url":null,"source":{"id":"https://openalex.org/S7407063277","display_name":"Research Commons (University of Waikato)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"The 42nd International Conference on Machine Learning (ICML 2025)","raw_type":"Conference Contribution"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4399418247","https://openalex.org/W2941261464","https://openalex.org/W7054686211","https://openalex.org/W4378965314","https://openalex.org/W4283802782","https://openalex.org/W4225863264","https://openalex.org/W3214756421","https://openalex.org/W7032951662","https://openalex.org/W3045272052","https://openalex.org/W2997018541"],"abstract_inverted_index":{"Decision":[0],"Tree":[1],"(DT)":[2],"Learning":[3],"is":[4,43,77,137],"a":[5,15,39,57,90,117,149],"fundamental":[6],"problem":[7,105],"in":[8,89,172],"Interpretable":[9],"Machine":[10],"Learning,":[11],"yet":[12],"it":[13,84,115,136],"poses":[14],"formidable":[16],"optimisation":[17],"challenge.":[18],"Practical":[19],"algorithms":[20],"have":[21],"recently":[22],"emerged,":[23],"primarily":[24],"leveraging":[25],"Dynamic":[26],"Programming":[27],"and":[28,52,112,127,132,147],"Branch":[29],"&":[30],"Bound.":[31],"However,":[32],"most":[33],"of":[34,56,74,98,143,151],"these":[35,70],"approaches":[36],"rely":[37],"on":[38,148],"Depth-First-Search":[40],"strategy,":[41],"which":[42],"inefficient":[44],"when":[45],"searching":[46],"for":[47,130],"DTs":[48],"at":[49],"high":[50],"depths":[51],"requires":[53],"the":[54,99,104,141,144,159],"definition":[55],"maximum":[58],"depth":[59],"hyper-parameter.":[60],"Best-First-Search":[61],"was":[62],"also":[63],"employed":[64],"by":[65],"other":[66,160],"methods":[67],"to":[68,86],"circumvent":[69],"issues.":[71],"The":[72],"downside":[73],"this":[75,165],"strategy":[76],"its":[78],"higher":[79],"memory":[80],"consumption,":[81],"as":[82],"such,":[83],"has":[85],"be":[87],"designed":[88],"fully":[91],"efficient":[92,139],"manner":[93],"that":[94,135,164],"takes":[95],"full":[96],"advantage":[97],"problem\u2019s":[100],"structure.":[101],"We":[102,123],"formulate":[103],"within":[106],"an":[107],"AND/OR":[108],"graph":[109],"search":[110],"framework":[111],"we":[113,133,162],"solve":[114],"with":[116],"novel":[118],"AO*-type":[119],"algorithm":[120],"called":[121],"BRANCHES.":[122],"prove":[124],"both":[125],"optimality":[126],"complexity":[128],"guarantees":[129],"BRANCHES":[131,154],"show":[134,163],"more":[138],"than":[140],"state":[142],"art":[145],"theoretically":[146],"variety":[150],"experiments.":[152],"Furthermore,":[153],"supports":[155],"nonbinary":[156],"features":[157],"unlike":[158],"methods,":[161],"property":[166],"can":[167],"further":[168],"induce":[169],"larger":[170],"gains":[171],"computational":[173],"efficiency.":[174]},"counts_by_year":[],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2026-09-04T00:00:00"}