
docs.javahelp.manual.boxes.search.r1.html Maven / Gradle / Ivy
Search Algorithms: PC
Search Algorithms: R1
The R1 ("Rule 1") algorithm is one of a set of pairwise orientation
algorithms included. To use it, first somehow
construct a graph with known adjacencies, by search or by loading a graph from
a file, and then make an Algorithm box that is a child of the graph in the
workbench. Then select R1 as the pairwise algorithm to be used. The adjacencies
in the input graph will oriented by appeal to non-Gaussianity.
References:
Spirtes, Glymour, and Scheines (2000). Causation, Prediction, and Search.
Chris Meek (1995), "Causal inference and causal explanation with background knowledge."
© 2015 - 2025 Weber Informatics LLC | Privacy Policy