{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001631701,0.000113335,0.0002245218,0.0002145845,0.00007181766,0.00009100112,0.0008148671,0.00006490237,0.000004740125],"category_scores_gemma":[0.0002147558,0.0001013087,0.0001750711,0.0001603627,0.00003570245,0.0003108974,0.0001213412,0.0001986461,4.861111e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008943918,"about_ca_system_score_gemma":0.00007709049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003951868,"about_ca_topic_score_gemma":1.30173e-7,"domain_scores_codex":[0.9986872,0.000108895,0.0005332638,0.0001217621,0.0002919384,0.0002569362],"domain_scores_gemma":[0.9978961,0.000378371,0.0006624394,0.0001400637,0.0007879809,0.00013509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001221957,0.0004034432,0.0009981655,0.00002680293,0.0003962205,0.000007482158,0.002841079,0.1558074,0.003630906,0.6229265,0.0001221912,0.2127176],"study_design_scores_gemma":[0.0003580849,0.000074702,0.0002112438,0.0003369816,0.00002405402,0.000256732,0.00008135738,0.9859504,0.004981122,0.007453177,0.0001532951,0.0001188344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007158227,0.0006515683,0.9900883,0.0002960631,0.001263931,0.00007815539,0.000002569202,0.00001795347,0.000443164],"genre_scores_gemma":[0.4787629,0.00001557724,0.5209832,0.00003883932,0.0001859711,0.00000318489,0.000001174382,0.000005741312,0.000003447622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.830143,"threshold_uncertainty_score":0.4131249,"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."}}