Package edu.cmu.tetrad.search
Class FasConcurrent
java.lang.Object
edu.cmu.tetrad.search.FasConcurrent
- All Implemented Interfaces:
IFas
Deprecated.
Use Fas instead; this is non-deterministic and gives problems with GSquare and ChiSquare.
Implements the "fast adjacency search" used in several causal algorithm in this package. In the fast adjacency
search, at a given stage of the search, 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. The fast adjacency search performs this
procedure for each pair of adjacent edges in the graph and for each depth 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. The interpretation of this adjacency
search is different for different algorithm, depending on the assumptions of the algorithm. A mapping from {x, y} to
S({x, y}) is returned for edges x *-* y that have been removed.
This variant uses the PC-Stable modification, calculating independencies in parallel within each depth. It uses a slightly different algorithm from FasStableConcurrent, probably better.
- Author:
- Joseph Ramsey.
-
Constructor Summary
ConstructorsConstructorDescriptionDeprecated.Constructs a new FastAdjacencySearch. -
Method Summary
Modifier and TypeMethodDescriptiongetAmbiguousTriples(Node node) Deprecated.intgetDepth()Deprecated.longDeprecated.Deprecated.Deprecated.Deprecated.The logger, by default the empty logger.getNodes()Deprecated.intDeprecated.intDeprecated.getOut()Deprecated.Deprecated.booleanDeprecated.booleanDeprecated.search()Deprecated.Discovers all adjacencies in data.Deprecated.voidsetDepth(int depth) Deprecated.voidsetKnowledge(Knowledge knowledge) Deprecated.voidsetLogger(TetradLogger logger) Deprecated.voidsetOut(PrintStream out) Deprecated.voidsetStable(boolean stable) Deprecated.voidsetVerbose(boolean verbose) Deprecated.
-
Constructor Details
-
FasConcurrent
Deprecated.Constructs a new FastAdjacencySearch. wd
-
-
Method Details
-
search
Deprecated.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. -
search
Deprecated. -
getElapsedTime
public long getElapsedTime()Deprecated.- Specified by:
getElapsedTimein interfaceIFas
-
getDepth
public int getDepth()Deprecated. -
setDepth
public void setDepth(int depth) Deprecated. -
isAggressivelyPreventCycles
public boolean isAggressivelyPreventCycles()Deprecated.- Specified by:
isAggressivelyPreventCyclesin interfaceIFas
-
getIndependenceTest
Deprecated.- Specified by:
getIndependenceTestin interfaceIFas
-
getKnowledge
Deprecated.- Specified by:
getKnowledgein interfaceIFas
-
setKnowledge
Deprecated.- Specified by:
setKnowledgein interfaceIFas
-
getNumIndependenceTests
public int getNumIndependenceTests()Deprecated.- Specified by:
getNumIndependenceTestsin interfaceIFas
-
getNodes
Deprecated. -
getAmbiguousTriples
Deprecated.- Specified by:
getAmbiguousTriplesin interfaceIFas
-
getSepsets
Deprecated.- Specified by:
getSepsetsin interfaceIFas
-
getLogger
Deprecated.The logger, by default the empty logger. -
setLogger
Deprecated. -
isVerbose
public boolean isVerbose()Deprecated. -
setVerbose
public void setVerbose(boolean verbose) Deprecated.- Specified by:
setVerbosein interfaceIFas
-
getNumDependenceJudgments
public int getNumDependenceJudgments()Deprecated.- Specified by:
getNumDependenceJudgmentsin interfaceIFas
-
setOut
Deprecated. -
getOut
Deprecated. -
setStable
public void setStable(boolean stable) Deprecated.
-