essentialGraph | R Documentation |
Find the essential graph from a given directed acyclic graph.
essentialGraph(dagx)
dagx |
a square binary matrix, the adjacency matrix of a directed acyclic graph. The names of rows and of the columns are the nodes of the DAG. |
Converts a DAG into the Essential Graph. Is implemented by the algorithm by D.M.Chickering (1995).
returns the adjacency matrix of the essential graph.
Giovanni M. Marchetti, from a MATLAB function by Tomas Kocka, AAU
Chickering, D.M. (1995). A transformational characterization of equivalent Bayesian network structures. Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, 87-98. Morgan Kaufmann.
DAG
, InducedGraphs
dag = DAG(U ~ Y+Z, Y~X, Z~X)
essentialGraph(dag)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.