AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms

by   Mohammad ali Javidian, et al.

We address the problem of finding a minimal separator in an Andersson-Madigan-Perlman chain graph (AMP CG), namely, finding a set Z of nodes that separate a given non-adjacent pair of nodes such that no proper subset of Z separates that pair. We analyze several versions of this problem and offer polynomial-time algorithms for each. These include finding a minimal separator from a restricted set of nodes, finding a minimal separator for two given disjoint sets, and testing whether a given separator is minimal. We provide an extension of the decomposition approach for learning Bayesian networks (BNs) proposed by (Xie et. al.) to learn AMP CGs, which include BNs as a special case, under the faithfulness assumption and prove its correctness using the minimal separator results. The advantages of this decomposition approach hold in the more general setting: reduced complexity and increased power of computational independence tests. In addition, we show that the PC-like algorithm is order-dependent, in the sense that the output can depend on the order in which the variables are given. We propose two modifications of the PC-like algorithm that remove part or all of this order-dependence. Simulations under a variety of settings demonstrate the competitive performance of our decomposition-based method, called LCD-AMP, in comparison with the (modified version of) PC-like algorithm. In fact, the decomposition-based algorithm usually outperforms the PC-like algorithm. We empirically show that the results of both algorithms are more accurate and stable when the sample size is reasonably large and the underlying graph is sparse.


page 1

page 2

page 3

page 4


Learning LWF Chain Graphs: an Order Independent Algorithm

LWF chain graphs combine directed acyclic graphs and undirected graphs. ...

Structural Learning of Multivariate Regression Chain Graphs via Decomposition

We extend the decomposition approach for learning Bayesian networks (BN)...

On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the...

Order-Independent Structure Learning of Multivariate Regression Chain Graphs

This paper deals with multivariate regression chain graphs (MVR CGs), wh...

Chordal Graphs in Triangular Decomposition in Top-Down Style

In this paper, we first prove that when the associated graph of a polyno...

On the Size of Minimal Separators for Treedepth Decomposition

Treedepth decomposition has several practical applications and can be us...

Learning Bayesian Networks that enable full propagation of evidence

This paper builds on recent developments in Bayesian network (BN) struct...

Please sign up or login with your details

Forgot password? Click here to reset