{"id":"W2989754355","doi":"10.24963/ijcai.2019/159","title":"Stochastic Constraint Propagation for Mining Probabilistic Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Institut de Valorisation des Données; Canada First Research Excellence Fund; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Probabilistic logic; Constraint programming; Constraint (computer-aided design); Mathematical optimization; Local consistency; Computer science; Propagator; Constraint satisfaction; Binary decision diagram; Constraint logic programming; Decomposition method (queueing theory); Constraint satisfaction problem; Binary constraint; Theoretical computer science; Stochastic programming; Mathematics; Discrete mathematics; 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.004473888,0.00142961,0.001162242,0.002889452,0.001059526,0.002019877,0.001912083,0.001496309,0.003333648],"category_scores_gemma":[0.02904203,0.001190514,0.001727323,0.003808559,0.001322052,0.003021888,0.002013859,0.002572502,0.0005690009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002100257,"about_ca_system_score_gemma":0.00279373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01122578,"about_ca_topic_score_gemma":0.01233068,"domain_scores_codex":[0.9966697,0.001499745,0.000179689,0.0005742079,0.0009297599,0.00014704],"domain_scores_gemma":[0.9717727,0.02462107,0.001345188,0.0006758149,0.001374414,0.0002108311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000401916,0.00003589952,0.001040833,0.0002111456,0.00009132578,0.0001272421,0.0001156741,0.8886541,0.0006427916,0.05011395,0.002196607,0.05673024],"study_design_scores_gemma":[0.000009081246,0.000004342938,0.00005988441,0.00001786297,0.000009759781,0.00001923173,0.00001225869,0.960507,0.0003834819,0.03798556,0.0009855232,0.000005914776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003521142,0.0001796993,0.994629,0.0002688875,0.00001318118,0.00006238675,0.000251749,0.000305261,0.0007688238],"genre_scores_gemma":[0.1519138,0.0007044052,0.842783,0.000288316,0.00009109041,0.0007027341,0.001663724,0.0002077326,0.001645211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01122578,"threshold_uncertainty_score":0.02366048,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02354860946469923,"score_gpt":0.2479518470998316,"score_spread":0.2244032376351324,"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."}}