Description Usage Arguments Details Value Author(s) References See Also Examples
Find the essential graph from a given directed acyclic graph.
1 | 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, translating 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.
http://research.microsoft.com/~dmax/publications/uai95.pdf
1 2 | dag = DAG(U ~ Y+Z, Y~X, Z~X)
essentialGraph(dag)
|
U Y Z X
U 0 0 0 0
Y 1 0 0 1
Z 1 0 0 1
X 0 1 1 0
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.