Package edu.cmu.tetrad.search
Class BfciTr
java.lang.Object
edu.cmu.tetrad.search.BfciTr
- All Implemented Interfaces:
GraphSearch
Does an FCI-style latent variable search using permutation-based reasoning. Follows GFCI to
an extent; the GFCI reference is this:
J.M. Ogarrio and P. Spirtes and J. Ramsey, "A Hybrid Causal Search Algorithm for Latent Variable Models," JMLR 2016.
- Author:
- jdramsey
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionintgetOut()getTest()The independence test.booleanbooleanTrue iff verbose output should be printed.search()voidsetCompleteRuleSetUsed(boolean completeRuleSetUsed) voidsetCovarianceMatrix(ICovarianceMatrix covarianceMatrix) voidsetKnowledge(Knowledge knowledge) voidsetMaxPathLength(int maxPathLength) voidsetOut(PrintStream out) voidsetTest(IndependenceTest test) voidsetVerbose(boolean verbose)
-
Constructor Details
-
BfciTr
-
-
Method Details
-
search
- Specified by:
searchin interfaceGraphSearch
-
isCompleteRuleSetUsed
public boolean isCompleteRuleSetUsed()- Returns:
- true if Zhang's complete rule set should be used, false if only R1-R4 (the rule set of the original FCI) should be used. False by default.
-
setCompleteRuleSetUsed
public void setCompleteRuleSetUsed(boolean completeRuleSetUsed) - Parameters:
completeRuleSetUsed- set to true if Zhang's complete rule set should be used, false if only R1-R4 (the rule set of the original FCI) should be used. False by default.
-
getMaxPathLength
public int getMaxPathLength()- Returns:
- the maximum length of any discriminating path, or -1 of unlimited.
-
setMaxPathLength
public void setMaxPathLength(int maxPathLength) - Parameters:
maxPathLength- the maximum length of any discriminating path, or -1 if unlimited.
-
isVerbose
public boolean isVerbose()True iff verbose output should be printed. -
setVerbose
public void setVerbose(boolean verbose) -
getTest
The independence test. -
setTest
-
getCovMatrix
-
getCovarianceMatrix
-
setCovarianceMatrix
-
getOut
-
setOut
-
setKnowledge
-