Class Cfci
java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.oracle.pag.Cfci
- All Implemented Interfaces:
Algorithm
,ReturnsBootstrapGraphs
,HasKnowledge
,HasParameters
,TakesIndependenceWrapper
,TetradSerializable
,Serializable
@Algorithm(name="CFCI",
command="cfci",
algoType=allow_latent_common_causes)
@Bootstrapping
public class Cfci
extends Object
implements Algorithm, HasKnowledge, TakesIndependenceWrapper, ReturnsBootstrapGraphs
Conservative FCI. This is a wrapper for the CFCI algorithm in Tetrad, which is conservative in the same sense as CPC,
Conservative PC. That is, it checks, for triple <X, Y, Z>, whether orienting colliders or noncoliders can be
done unambiguously. If not, it leaves the edge undirected. It is also similar to FCI in that it allows for latent
common causes.
- Version:
- $Id: $Id
- Author:
- josephramsey
- See Also:
-
Constructor Summary
ConstructorsConstructorDescriptionCfci()
Constructs a new conservative FCI algorithm.Cfci
(IndependenceWrapper test) Constructs a new conservative FCI algorithm with the given independence test. -
Method Summary
Modifier and TypeMethodDescriptionReturns the bootstrap graphs.getComparisonGraph
(Graph graph) Returns that graph that the result should be compared to.Returns the data type that the search requires, whether continuous, discrete, or mixed.Returns the description of the algorithm.Returns the independence wrapper.Returns a knowledge object.Returns the parameters that this search uses.search
(DataModel dataModel, Parameters parameters) Runs the search.void
Sets the independence wrapper.void
setKnowledge
(Knowledge knowledge) Sets a knowledge object.
-
Constructor Details
-
Cfci
public Cfci()Constructs a new conservative FCI algorithm. -
Cfci
Constructs a new conservative FCI algorithm with the given independence test.- Parameters:
test
- the independence test
-
-
Method Details
-
search
Runs the search.Runs the conservative FCI search.
-
getComparisonGraph
Returns that graph that the result should be compared to.Returns the comparison graph.
- Specified by:
getComparisonGraph
in interfaceAlgorithm
- Parameters:
graph
- The true directed graph, if there is one.- Returns:
- The comparison graph.
-
getDescription
Returns the description of the algorithm.- Specified by:
getDescription
in interfaceAlgorithm
- Returns:
- The description of the algorithm.
-
getDataType
Returns the data type that the search requires, whether continuous, discrete, or mixed.Returns the data type that the algorithm can handle.
- Specified by:
getDataType
in interfaceAlgorithm
- Returns:
- This type.
-
getParameters
Returns the parameters that this search uses.Returns the parameters of the algorithm.
- Specified by:
getParameters
in interfaceAlgorithm
- Specified by:
getParameters
in interfaceHasParameters
- Returns:
- A list of String names of parameters.
-
getKnowledge
Returns a knowledge object.Returns the knowledge.
- Specified by:
getKnowledge
in interfaceHasKnowledge
- Returns:
- a knowledge object.
-
setKnowledge
Sets a knowledge object.Sets the knowledge.
- Specified by:
setKnowledge
in interfaceHasKnowledge
- Parameters:
knowledge
- a knowledge object.
-
getIndependenceWrapper
Returns the independence wrapper.Returns the independence test.
- Specified by:
getIndependenceWrapper
in interfaceTakesIndependenceWrapper
- Returns:
- the independence wrapper.
-
setIndependenceWrapper
Sets the independence wrapper.Sets the independence wrapper.
- Specified by:
setIndependenceWrapper
in interfaceTakesIndependenceWrapper
- Parameters:
test
- the independence wrapper.
-
getBootstrapGraphs
Returns the bootstrap graphs.Returns the bootstrap graphs.
- Specified by:
getBootstrapGraphs
in interfaceReturnsBootstrapGraphs
- Returns:
- the bootstrap graphs.
-