{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003734765,0.001056967,0.001476492,0.002900361,0.001341175,0.002194261,0.002730377,0.001349071,0.01148378],"category_scores_gemma":[0.01711949,0.001389356,0.002543512,0.003285317,0.001123716,0.003711084,0.002311419,0.003080128,0.003727592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008771532,"about_ca_system_score_gemma":0.001612233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0025987,"about_ca_topic_score_gemma":0.006895947,"domain_scores_codex":[0.9977635,0.0007721689,0.0001585012,0.000332813,0.0007572139,0.0002157161],"domain_scores_gemma":[0.9933065,0.003951774,0.0002582686,0.001286493,0.001024422,0.0001727151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001519768,0.0001603604,0.001177941,0.0002878913,0.0001246986,0.0001241566,0.0005069268,0.07483543,0.003682425,0.4914871,0.01037336,0.4170878],"study_design_scores_gemma":[0.00005467107,0.00003822025,0.0003085699,0.00007454912,0.00009974481,0.0001295245,0.00008142564,0.4199628,0.002727207,0.563041,0.01344618,0.00003618158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007917015,0.00004952907,0.99822,0.00002437087,0.00001020524,0.00001892983,0.00005296008,0.0001755824,0.0006566513],"genre_scores_gemma":[0.02158376,0.0001428261,0.975525,0.00005383692,0.00002642682,0.0001219911,0.0004139647,0.0003163574,0.001815728],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01148378,"threshold_uncertainty_score":0.0384171,"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."}}