{"id":"W2035553648","doi":"10.1016/j.ijar.2012.03.001","title":"Efficient indexing methods for recursive decompositions of Bayesian networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search engine indexing; Computer science; Redundancy (engineering); Computation; Bayesian network; Theoretical computer science; Bayesian probability; Decomposition; Data mining; Graph; Algorithm; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.005681523,0.001310113,0.002560667,0.003776122,0.001202935,0.004495991,0.003573715,0.001498744,0.008723099],"category_scores_gemma":[0.03345503,0.001275524,0.002225729,0.004558244,0.001292462,0.006528169,0.003985301,0.003657117,0.002599644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002034569,"about_ca_system_score_gemma":0.003036725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005106418,"about_ca_topic_score_gemma":0.008380544,"domain_scores_codex":[0.9960388,0.001650489,0.0003963185,0.0004947234,0.00107129,0.0003483608],"domain_scores_gemma":[0.9847966,0.01013498,0.0006474218,0.002401423,0.001545,0.0004745601],"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.0002838328,0.0002195463,0.001132039,0.0003970464,0.0001230142,0.0001029226,0.0005222862,0.1182263,0.002906181,0.3408459,0.01132037,0.5239207],"study_design_scores_gemma":[0.00004959267,0.00002756694,0.0001551973,0.00004850627,0.00003545314,0.00004464254,0.00006224529,0.67156,0.000876501,0.3241123,0.003005927,0.00002191965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002661994,0.0002325163,0.9956476,0.00008309652,0.00002592026,0.00004444406,0.0001645517,0.0004966493,0.0006432228],"genre_scores_gemma":[0.07123552,0.0005875425,0.9236695,0.00009928103,0.0001233481,0.0002941687,0.001426115,0.0005190808,0.002045502],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008723099,"threshold_uncertainty_score":0.03004718,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02356952683443952,"score_gpt":0.3597113663957673,"score_spread":0.3361418395613278,"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."}}