Class Ftfc
java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
edu.cmu.tetrad.algcomparison.algorithm.cluster.Ftfc
- All Implemented Interfaces:
- Algorithm,- ClusterAlgorithm,- ReturnsBootstrapGraphs,- TakesCovarianceMatrix,- HasKnowledge,- HasParameters,- TetradSerializable,- Serializable
@Algorithm(name="FTFC",
           command="ftfc",
           algoType=search_for_structure_over_latents)
@Bootstrapping
public class Ftfc
extends AbstractBootstrapAlgorithm
implements Algorithm, HasKnowledge, ClusterAlgorithm, TakesCovarianceMatrix
FTFC.
- Version:
- $Id: $Id
- Author:
- josephramsey
- See Also:
- 
Constructor SummaryConstructors
- 
Method SummaryModifier and TypeMethodDescriptiongetComparisonGraph(Graph graph) Retrieves the comparison graph for the given true directed graph.Returns the type of the data set that the search algorithm requires.Returns a short, one-line description of this algorithm.Returns the knowledge associated with this algorithm.Retrieves the list of parameters supported by this algorithm.runSearch(DataModel dataSet, Parameters parameters) Runs the search algorithm to find a causal graph.voidsetKnowledge(Knowledge knowledge) Sets the knowledge associated with this algorithm.Methods inherited from class edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithmgetBootstrapGraphs, search
- 
Constructor Details- 
Ftfcpublic Ftfc()Constructor for Ftfc. 
 
- 
- 
Method Details- 
runSearchRuns the search algorithm to find a causal graph.- Parameters:
- dataSet- The data set or covariance matrix to search.
- parameters- The search parameters.
- Returns:
- The causal graph discovered by the search algorithm.
- Throws:
- IllegalArgumentException- if the dataSet is not a dataset or a covariance matrix.
 
- 
getComparisonGraphRetrieves the comparison graph for the given true directed graph.- Specified by:
- getComparisonGraphin interface- Algorithm
- Parameters:
- graph- The true directed graph, if there is one.
- Returns:
- The comparison graph, which is a completed partially directed acyclic graph (CPDAG) of the input graph.
 
- 
getDescriptionReturns a short, one-line description of this algorithm. This will be printed in the report.- Specified by:
- getDescriptionin interface- Algorithm
- Returns:
- The description of the algorithm.
 
- 
getDataTypeReturns the type of the data set that the search algorithm requires. The data set can be continuous, discrete, or mixed.- Specified by:
- getDataTypein interface- Algorithm
- Returns:
- The data type required by the search algorithm.
 
- 
getParametersRetrieves the list of parameters supported by this algorithm. The parameters include ALPHA, USE_WISHART, USE_GAP, PRECOMPUTE_COVARIANCES, and VERBOSE.- Specified by:
- getParametersin interface- HasParameters
- Returns:
- The list of parameters supported by this algorithm.
 
- 
getKnowledgeReturns the knowledge associated with this algorithm.- Specified by:
- getKnowledgein interface- HasKnowledge
- Returns:
- The knowledge associated with this algorithm.
 
- 
setKnowledgeSets the knowledge associated with this algorithm.- Specified by:
- setKnowledgein interface- HasKnowledge
- Parameters:
- knowledge- the knowledge object to be set
 
 
-