{"id":"W4378965314","doi":"","title":"Blossom: an Anytime Algorithm for Computing Optimal Decision Trees","year":2023,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Council of Prairie and Pacific University Libraries","funders":"HORIZON EUROPE Framework Programme; Agence Nationale de la Recherche; European Commission","keywords":"Computer science; Decision tree; Algorithm design; Algorithm; Theoretical computer science; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006803094,0.0004458301,0.0005006519,0.0002958543,0.0006088551,0.001448462,0.00387924,0.0004010955,0.00001338951],"category_scores_gemma":[0.0008347133,0.0004809088,0.0002858706,0.0004998659,0.0001502547,0.0003678899,0.003117774,0.0006774457,0.000063152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001059725,"about_ca_system_score_gemma":0.0004062116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005103155,"about_ca_topic_score_gemma":0.0003397242,"domain_scores_codex":[0.994568,0.002018778,0.0007171399,0.001518236,0.0005764064,0.0006013935],"domain_scores_gemma":[0.9914067,0.002376041,0.0004974557,0.003063409,0.002337063,0.0003193325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005426428,0.0003656769,0.00006991289,0.00005254887,0.00005364463,0.000007427479,0.004916656,0.003981886,0.0003474746,0.05219197,0.001008479,0.9369989],"study_design_scores_gemma":[0.0003744018,0.000001510717,0.0005129912,0.001107377,0.00002216422,0.00000885085,0.00003637444,0.9692051,0.004294498,0.02301567,0.0009245922,0.0004964277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01339419,0.0002873557,0.9801407,0.00297306,0.0005809574,0.0004854474,0.00007779298,0.001048608,0.001011828],"genre_scores_gemma":[0.1348038,0.0001210491,0.8625262,0.00009066644,0.00006992454,0.00006146615,0.0003128979,0.00006018622,0.001953778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9652233,"threshold_uncertainty_score":0.9997643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0357001392355436,"score_gpt":0.280532525779543,"score_spread":0.2448323865439994,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}