Plot an ABN DAG using formula statement or a matrix in using Rgraphviz through the graphAM class
a matrix or a formula statement (see ‘Details’ for format) defining the network structure, a directed acyclic graph (DAG).
a vector of names if the DAG is given via formula, see ‘Details’.
a character value that can be: minimal or complete, see ‘Details’.
This function returns an essential graph from a DAG. This can be useful if the learning procedure is defined up to a Markov class of equivalence. A minimal PDAG is defined as only directed edges are those who participate in v-structure. Whereas the completed PDAG: every directed edge corresponds to a compelled edge, and every undirected edge corresponds to a reversible edge.
dag can be provided using a formula statement (similar to glm). A typical formula is
~ node1|parent1:parent2 + node2:node3|parent3. The formula statement have to start with
~. In this example, node1 has two parents (parent1 and parent2). node2 and node3 have the same parent3. The parents names have to exactly match those given in
: is the separator between either children or parents,
| separates children (left side) and parents (right side),
+ separates terms,
. replaces all the variables in
A matrix giving the PDAG.
West, D. B. (2001). Introduction to Graph Theory. Vol. 2. Upper Saddle River: Prentice Hall.
Further information about abn can be found at:
1 2 3 4 5
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.