AI Paper Atlas

Research map / Probabilistic and scientific modeling / Causal discovery

Bayesian Network Structural Consensus via Greedy Min-Cut Analysis

Pablo Torrijos, Jose M. Puerta, Juan A. Aledo, José A. Gámez

AAAI 2026 · Probabilistic and scientific modeling › Causal discovery · approach: Differentiable and score-based DAG learning · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
prune fused network with min-cut MCBNC instead of unrestricted fusionBayesian network fusion · 15 BNs x 6 client countsSMHD rank: 2.69 -> 1.40Improved
MCBNC vs average of input GES DAGsBayesian network fusion · 15 BNs x 6 client countsSMHD rank: 1.91 -> 1.40Improved
MCBNC vs input GES DAGs on data fitBayesian network fusion · 15 BNs x 6 client countsBDeu rank: 1.58 vs 1.70 (p = 4.12e-1)No clear effect
MCBNC vs unrestricted fusion on data fitBayesian network fusion · 15 BNs x 6 client countsBDeu rank: 2.72 -> 1.70Improved
vary conditioning-set cap kmax (ablation)MCBNC · BNsconsensus quality and runtimeNo clear effect
over-pruning with theta near 1 (ablation)MCBNC · BNsSMHDHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy