Skip to search formSkip to main contentSkip to account menu

M-separation

In statistics, m-separation is a measure of disconnectedness in ancestral graphs and a generalization of d-separation for directed acyclic graphs. It… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Ancestral graphDirected acyclic graphPath (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Answering Hindsight Queries with Lifted Dynamic Junction Trees
The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic… 
2017
2017
On Darwinian Networks
We suggest Darwinian Networks (DNs) as a simplification of working with Bayesian networks (BNs). DNs adapt a handful of well… 
2016
2016
A Simple Method for Testing Independencies in Bayesian Networks
Testing independencies is a fundamental task in reasoning with Bayesian networks BNs. In practice, d-separation is often utilized… 
2016
2016
Simplifying D-Separation and M-Separation in Bayesian Networks
2015
2015
Introducing Darwinian Networks
Darwinian networks (DNs) are introduced to simplify and clarify working with Bayesian networks (BNs). Rather than modelling the… 
2013
2013
Supplement - Learning Sparse Causal Models is not NP-hard
  • 2013
  • Corpus ID: 237526185
This article contains detailed proofs and additional examples related to the UAI-2013 submission ‘Learning Sparse Causal Models… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)