Description Usage Arguments Details Value Author(s) References See Also Examples
Create, test, or manipulate objects of type "causality.pattern"
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | pattern(nodes, edges, validate = TRUE)
is_valid_pattern(graph)
is.pattern(graph)
as.pattern(graph)
## Default S3 method:
as.pattern(graph)
## S3 method for class 'causality.dag'
as.pattern(graph)
## S3 method for class 'causality.pdag'
as.pattern(graph)
## S3 method for class 'causality.pag'
as.pattern(graph)
## S3 method for class 'causality.graph'
as.pattern(graph)
|
nodes |
A character array of node names |
edges |
A m x 3 character matrix. Each row is an edge in the form of (node1, node2, edgetype), with node1 and node2 being in nodes. Valid edge types are listed below |
validate |
logical value to determine whether or not to check to see
if the graph is valid before returning it. Default is |
graph |
A graph to coerced or tested |
TODO
is_valid_pattern
checks to see if the input is a valid
"causality.pattern". Specifically, it checks that the graph
is
nonlatent acyclic graph that is invarient under the meek
rules (ie that it is a Completed PDAG – AKA a pattern).
is.pattern
tests whether or not an object has the class
"causality.pattern"
dag
returns object of class "causality.pattern", or an error
if the graph is invalid (assuming validate = TRUE
).
is_valid_pattern
returns TRUE
or FALSE
depending
on whether or not the input is a valid "causality.pattern".
is.pattern
returns TRUE
or FALSE
.
Alexander Rix
Spirtes et al. “Causation, Prediction, and Search.”, Mit Press, 2001, p. 109.
Spirtes P. Introduction to causal inference. Journal of Machine Learning Research. 2010;11(May):1643-62.
Pearl, Judea. Causality. Cambridge university press, 2009.
The algorithm used to convert dags to patterns is used by Chickering(1995)
Chickering DM. A transformational characterization of equivalent Bayesian network structures. InProceedings of the Eleventh conference on Uncertainty in artificial intelligence 1995 Aug 18 (pp. 87-98). Morgan Kaufmann Publishers Inc..
The algorithm by Dor and Tarsi is used to construct patterns from pdags
Dor D, Tarsi M. A simple algorithm to construct a consistent extension of a partially oriented graph. Technicial Report R-185, Cognitive Systems Laboratory, UCLA. 1992 Oct 23.
Other causality classes: cgraph
, dag
1 | TODO
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.