Class SvarGFci
- All Implemented Interfaces:
GraphSearch
Following an idea of Spirtes, now it uses more of the information in GES, to calculating possible dsep paths and to utilize unshielded colliders found by GES. 5/31/2015
Previous: Extends Erin Korber's implementation of the Fast Causal Inference algorithm (found in Fci.java) with Jiji Zhang's Augmented FCI rules (found in sec. 4.1 of Zhang's 2006 PhD dissertation, "Causal Inference and Reasoning in Causally Insufficient Systems").
This class is based off a copy of Fci.java taken from the repository on 2008/12/16, revision 7306. The extension is done by extending doFinalOrientation() with methods for Zhang's rules R5-R10 which implements the augmented search. (By a remark of Zhang's, the rule applications can be staged in this way.)
- Author:
- Erin Korber, June 2004, Alex Smith, December 2008, Joseph Ramsey, Choh-Man Teng, Daniel Malinsky
-
Constructor Summary
ConstructorsConstructorDescriptionSvarGFci
(IndependenceTest test, Score score) Constructs a new GFCI search for the given independence test and background knowledge. -
Method Summary
Modifier and TypeMethodDescriptionThe independence test.int
int
getNameNoLag
(Object obj) getOut()
double
boolean
boolean
True iff verbose output should be printed.void
modifiedR0
(Graph fgesGraph) void
removeSimilarEdges
(Node x, Node y) search()
void
setCompleteRuleSetUsed
(boolean completeRuleSetUsed) void
setCovarianceMatrix
(ICovarianceMatrix covarianceMatrix) void
setFaithfulnessAssumed
(boolean faithfulnessAssumed) void
setIndependenceTest
(IndependenceTest independenceTest) void
setKnowledge
(Knowledge knowledge) void
setMaxIndegree
(int maxIndegree) void
setMaxPathLength
(int maxPathLength) void
setOut
(PrintStream out) void
setPenaltyDiscount
(double penaltyDiscount) void
setSamplePrior
(double samplePrior) void
setStructurePrior
(double structurePrior) void
setVerbose
(boolean verbose)
-
Constructor Details
-
SvarGFci
Constructs a new GFCI search for the given independence test and background knowledge.
-
-
Method Details
-
search
- Specified by:
search
in interfaceGraphSearch
-
getMaxIndegree
public int getMaxIndegree() -
setMaxIndegree
public void setMaxIndegree(int maxIndegree) -
modifiedR0
-
getKnowledge
-
setKnowledge
-
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) -
getIndependenceTest
The independence test. -
getPenaltyDiscount
public double getPenaltyDiscount() -
setPenaltyDiscount
public void setPenaltyDiscount(double penaltyDiscount) -
getCovMatrix
-
getCovarianceMatrix
-
setCovarianceMatrix
-
getOut
-
setOut
-
setIndependenceTest
-
setFaithfulnessAssumed
public void setFaithfulnessAssumed(boolean faithfulnessAssumed) -
setSamplePrior
public void setSamplePrior(double samplePrior) -
setStructurePrior
public void setStructurePrior(double structurePrior) -
getNameNoLag
-
removeSimilarEdges
-