{"id":"https://openalex.org/W4415524126","doi":"https://doi.org/10.1109/mlsp62443.2025.11204340","title":"Meta-Tree: Bayesian Approach to Avoid Overfitting in Decision Trees and Analysis on the Application to Boosting","display_name":"Meta-Tree: Bayesian Approach to Avoid Overfitting in Decision Trees and Analysis on the Application to Boosting","publication_year":2025,"publication_date":"2025-08-31","ids":{"openalex":"https://openalex.org/W4415524126","doi":"https://doi.org/10.1109/mlsp62443.2025.11204340"},"language":null,"primary_location":{"id":"doi:10.1109/mlsp62443.2025.11204340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mlsp62443.2025.11204340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 35th International Workshop on Machine Learning for Signal Processing (MLSP)","raw_type":"proceedings-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/A5082627845","display_name":"Naoki Ichijo","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Naoki Ichijo","raw_affiliation_strings":["Waseda University,Dept. of Pure and Applied Math.,Tokyo,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Waseda University,Dept. of Pure and Applied Math.,Tokyo,Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110471799","display_name":"Toshiyasu Matsushima","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiyasu Matsushima","raw_affiliation_strings":["Waseda University,Dept. of Pure and Applied Math.,Tokyo,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Waseda University,Dept. of Pure and Applied Math.,Tokyo,Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.4098836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.7541000247001648,"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.7541000247001648,"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/T12761","display_name":"Data Stream Mining Techniques","score":0.7250000238418579,"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/T10320","display_name":"Neural Networks and Applications","score":0.6607000231742859,"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/overfitting","display_name":"Overfitting","score":0.9218999743461609},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.8001000285148621},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.7734000086784363},{"id":"https://openalex.org/keywords/gradient-boosting","display_name":"Gradient boosting","score":0.5758000016212463},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.527899980545044},{"id":"https://openalex.org/keywords/incremental-decision-tree","display_name":"Incremental decision tree","score":0.4756999909877777},{"id":"https://openalex.org/keywords/decision-stump","display_name":"Decision stump","score":0.4560999870300293},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44519999623298645},{"id":"https://openalex.org/keywords/bayes-theorem","display_name":"Bayes' theorem","score":0.4399999976158142}],"concepts":[{"id":"https://openalex.org/C22019652","wikidata":"https://www.wikidata.org/wiki/Q331309","display_name":"Overfitting","level":3,"score":0.9218999743461609},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.8001000285148621},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.7734000086784363},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6776000261306763},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6226999759674072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6089000105857849},{"id":"https://openalex.org/C70153297","wikidata":"https://www.wikidata.org/wiki/Q5591907","display_name":"Gradient boosting","level":3,"score":0.5758000016212463},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C10229987","wikidata":"https://www.wikidata.org/wiki/Q17083028","display_name":"Incremental decision tree","level":4,"score":0.4756999909877777},{"id":"https://openalex.org/C141291300","wikidata":"https://www.wikidata.org/wiki/Q5249244","display_name":"Decision stump","level":5,"score":0.4560999870300293},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C207201462","wikidata":"https://www.wikidata.org/wiki/Q182505","display_name":"Bayes' theorem","level":3,"score":0.4399999976158142},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40639999508857727},{"id":"https://openalex.org/C45942800","wikidata":"https://www.wikidata.org/wiki/Q245652","display_name":"Ensemble learning","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C52001869","wikidata":"https://www.wikidata.org/wiki/Q812530","display_name":"Naive Bayes classifier","level":3,"score":0.4032000005245209},{"id":"https://openalex.org/C120136583","wikidata":"https://www.wikidata.org/wiki/Q4736414","display_name":"Alternating decision tree","level":5,"score":0.3910999894142151},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3357999920845032},{"id":"https://openalex.org/C5481197","wikidata":"https://www.wikidata.org/wiki/Q16766476","display_name":"Decision tree learning","level":3,"score":0.3319000005722046},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.32670000195503235},{"id":"https://openalex.org/C61722155","wikidata":"https://www.wikidata.org/wiki/Q6667643","display_name":"Logistic model tree","level":3,"score":0.2985000014305115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29429998993873596},{"id":"https://openalex.org/C141404830","wikidata":"https://www.wikidata.org/wiki/Q2823869","display_name":"AdaBoost","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C2984634286","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision process","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C186116695","wikidata":"https://www.wikidata.org/wiki/Q5249226","display_name":"Decision analysis","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mlsp62443.2025.11204340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mlsp62443.2025.11204340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 35th International Workshop on Machine Learning for Signal Processing (MLSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1988520084","https://openalex.org/W2126292488","https://openalex.org/W2151832869","https://openalex.org/W3175260198","https://openalex.org/W4214506138"],"related_works":[],"abstract_inverted_index":{"This":[0,43,97],"study":[1],"addresses":[2],"the":[3,27,53,57,72,114,128],"Bayes":[4,75],"decision":[5,9,76,92],"theoretic":[6],"approach":[7],"to":[8,49,102],"trees":[10],"in":[11,71],"regression":[12],"problems.":[13],"In":[14,78],"this":[15,79],"approach,":[16],"we":[17,81],"employ":[18],"a":[19,67,84,91,95],"method":[20,85],"called":[21],"meta-tree.":[22,96],"A":[23],"key":[24],"advantage":[25],"of":[26,74,144],"meta-tree":[28,68],"is":[29],"that":[30,86,110,132],"it":[31],"enables":[32],"efficient":[33],"posterior":[34],"calculation":[35],"and":[36,118,141],"marginalization":[37,44,65],"over":[38],"all":[39],"possible":[40],"tree":[41,50,58,93],"structures.":[42],"mitigates":[45,87],"overfitting":[46,88],"with":[47],"respect":[48],"depth":[51],"without":[52],"need":[54],"for":[55],"tuning":[56],"depth.":[59],"Furthermore,":[60],"predictions":[61],"obtained":[62],"from":[63],"such":[64],"using":[66],"achieve":[69],"optimality":[70],"sense":[73],"theory.":[77],"study,":[80],"propose":[82,107],"meta-treezation,":[83],"by":[89],"transforming":[90],"into":[94,113],"meta-treezation":[98],"can":[99],"be":[100],"applied":[101],"various":[103],"ensemble":[104],"methods.":[105],"We":[106],"an":[108,145],"algorithm":[109],"incorporates":[111],"metatrees":[112],"gradient":[115],"boosting":[116,129],"framework":[117],"demonstrate":[119],"its":[120],"effectiveness":[121],"through":[122],"empirical":[123],"evaluation.":[124],"Comparative":[125],"analysis":[126],"throughout":[127],"process":[130],"shows":[131],"meta-trees":[133],"effectively":[134],"mitigate":[135],"overfitting,":[136],"both":[137],"when":[138],"used":[139],"individually":[140],"as":[142],"part":[143],"ensemble.":[146]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-24T00:00:00"}