Class FasDci

java.lang.Object
edu.cmu.tetrad.search.work_in_progress.FasDci

public class FasDci extends Object
Implements a modified version of the the "fast adjacency search" for use in the Distributed Causal Inference (DCI) algorithm. This version accepts an independence test for a particular dataset and a supergraph containing varialbes from each dataset. At a given stage, an edge X*-*Y is removed from the graph if X _||_ Y | S, where S is a subset of size d either of adj(X) or of adj(Y), where d is the depth of the search. This procedure is performed for each pair of adjacent edges in the graph that are jointly measured with S in the dataset and for d = 0, 1, 2, ..., d1, where d1 is either the maximum depth or else the first such depth at which no edges can be removed. A mapping from {x, y} to S({x, y}) is returned for edges x *-* y that have been removed.
Version:
$Id: $Id
Author:
Robert Tillman.