Package edu.cmu.tetrad.search.work_in_progress

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.

Author:

Robert Tillman.

Constructor Summary

Constructors

Constructor	Description
FasDci(Graph graph, IndependenceTest independenceTest)	Constructs a new FastAdjacencySearch for DCI.
FasDci(Graph graph, IndependenceTest independenceTest, ResolveSepsets.Method method, List<Set<Node>> marginalVars, List<IndependenceTest> independenceTests, SepsetMapDci knownIndependencies, SepsetMapDci knownAssociations)	Constructs a new FastAdjacencySearch for DCI with independence test pooling to resolve inconsistencies.

Method Summary

Modifier and Type	Method	Description
int	getDepth()
Knowledge	getKnowledge()
int	getNumIndependenceTests()
SepsetMapDci	search()	Discovers all adjacencies in data.
void	setDepth(int depth)
void	setKnowledge(Knowledge knowledge)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

FasDci

public FasDci(Graph graph,
 IndependenceTest independenceTest)

Constructs a new FastAdjacencySearch for DCI.

FasDci

public FasDci(Graph graph,
 IndependenceTest independenceTest,
 ResolveSepsets.Method method,
 List<Set<Node>> marginalVars,
 List<IndependenceTest> independenceTests,
 SepsetMapDci knownIndependencies,
 SepsetMapDci knownAssociations)

Constructs a new FastAdjacencySearch for DCI with independence test pooling to resolve inconsistencies.

Method Details

search

public SepsetMapDci search()

Discovers all adjacencies in data. The procedure is to remove edges in the graph which connect pairs of variables which are independent conditional on some other set of variables in the graph (the "sepset"). These are removed in tiers. First, edges which are independent conditional on zero other variables are removed, then edges which are independent conditional on one other variable are removed, then two, then three, and so on, until no more edges can be removed from the graph. The edges which remain in the graph after this procedure are the adjacencies in the data.

Returns:

a SepSet, which indicates which variables are independent conditional on which other variables

getDepth

public int getDepth()

setDepth

public void setDepth(int depth)

getKnowledge

public Knowledge getKnowledge()

setKnowledge

public void setKnowledge(Knowledge knowledge)

getNumIndependenceTests

public int getNumIndependenceTests()