{"id":"W1967824220","doi":"10.1016/j.ijar.2009.04.010","title":"Methods for constructing balanced elimination trees and other recursive decompositions","year":2009,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan; University of Lethbridge","funders":"","keywords":"Heuristics; Variable elimination; Inference; Factorization; Computer science; Constructive; Tree (set theory); Simple (philosophy); Mathematics; Algorithm; Mathematical optimization; Theoretical computer science; Process (computing); Artificial intelligence; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0006509965,0.00008714095,0.0001467283,0.0001503144,0.00007134549,0.0002189164,0.0003940425,0.00004033525,0.00000208179],"category_scores_gemma":[0.0002244083,0.0000784746,0.00006685536,0.00007639782,0.00002688826,0.000456342,0.00003189226,0.0001140667,2.994877e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004720817,"about_ca_system_score_gemma":0.00004666185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001755227,"about_ca_topic_score_gemma":3.162097e-7,"domain_scores_codex":[0.9992002,0.00006030928,0.0003097673,0.0001373983,0.0001699558,0.0001223204],"domain_scores_gemma":[0.9987576,0.0002263639,0.0003683587,0.00007390913,0.0005129903,0.00006078956],"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.00004028287,0.00003704773,0.00013595,0.000003341913,0.00005786941,0.000005045883,0.0007707077,0.0002629962,0.01125245,0.4368874,0.00002978659,0.5505171],"study_design_scores_gemma":[0.001678733,0.0004686401,0.001330457,0.0007727856,0.00004616418,0.002043415,0.0005135039,0.6397578,0.03461381,0.3175187,0.0009085116,0.000347467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01511999,0.0002085315,0.9818071,0.001798922,0.0003275525,0.00005845398,0.000002876973,0.00002366444,0.0006528996],"genre_scores_gemma":[0.3430239,0.0000226191,0.6566479,0.0002035008,0.00009162111,0.000001648614,8.14979e-7,0.000003222093,0.000004717068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6394948,"threshold_uncertainty_score":0.3200101,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02472948351520498,"score_gpt":0.3663899252074714,"score_spread":0.3416604416922664,"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."}}