Class DmFciT2
java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
edu.cmu.tetrad.algcomparison.algorithm.oracle.pag.DmFciT2
- All Implemented Interfaces:
- Algorithm,- ReturnsBootstrapGraphs,- TakesCovarianceMatrix,- HasKnowledge,- HasParameters,- TakesIndependenceWrapper,- UsesScoreWrapper,- TetradSerializable,- Serializable
public class DmFciT2
extends AbstractBootstrapAlgorithm
implements Algorithm, UsesScoreWrapper, TakesIndependenceWrapper, HasKnowledge, ReturnsBootstrapGraphs, TakesCovarianceMatrix
This class represents the Detect-Mimic-FCIT (DM-FCIT) algorithm, a specialized variant of the DM-PC and FCIT
 algorithms designed to identify intermediate latent variables. DM-FCIT enhances accuracy and computational
 efficiency by recursively maintaining complete PAG orientations during the search process. At each step, it uses
 these orientations to substantially reduce the required size of conditioning sets when testing independence. This
 approach leads to more precise identification of latent variables and better orientation accuracy overall.
- Author:
- josephramsey
- See Also:
- 
Constructor SummaryConstructorsConstructorDescriptionDmFciT2()This class represents a DM-FCIT algorithm.DmFciT2(IndependenceWrapper test, ScoreWrapper score) Represents a DM-FCIT algorithm.
- 
Method SummaryModifier and TypeMethodDescriptiongetComparisonGraph(Graph graph) Retrieves a comparison graph by transforming a true directed graph into a partially directed graph (PAG).Retrieves the data type required by the search algorithm.Returns a short, one-line description of this algorithm.Retrieves the IndependenceWrapper object associated with this instance.Retrieves the knowledge object associated with this method.Retrieves the list of parameters used by the algorithm.Retrieves the ScoreWrapper object associated with this method.runSearch(DataModel dataModel, Parameters parameters) Runs the search algorithm to find a graph structure based on a given data model and parameters.voidsetIndependenceWrapper(IndependenceWrapper independenceWrapper) Sets the IndependenceWrapper object for this algorithm.voidsetKnowledge(Knowledge knowledge) Sets the knowledge object associated with this method.voidsetScoreWrapper(ScoreWrapper score) Sets the score wrapper for the algorithm.Methods inherited from class edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithmgetBootstrapGraphs, searchMethods inherited from class java.lang.Objectequals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface edu.cmu.tetrad.algcomparison.algorithm.ReturnsBootstrapGraphsgetBootstrapGraphs
- 
Constructor Details- 
DmFciT2public DmFciT2()This class represents a DM-FCIT algorithm.The DM-FCIT algorithm is a bootstrap algorithm that runs a search algorithm to find a graph structure based on a given data set and parameters. It is a subclass of the Abstract BootstrapAlgorithm class and implements the Algorithm interface. - See Also:
 
- 
DmFciT2Represents a DM-FCIT algorithm.The DM-FCIT algorithm is a bootstrap algorithm that runs a search algorithm to find a graph structure based on a given data set and parameters. It is a subclass of the AbstractBootstrapAlgorithm class and implements the Algorithm interface. - Parameters:
- test- The independence test to use.
- score- The score to use.
- See Also:
 
 
- 
- 
Method Details- 
runSearchRuns the search algorithm to find a graph structure based on a given data model and parameters.- Parameters:
- dataModel- The data model to use for the search algorithm.
- parameters- The parameters to configure the search algorithm.
- Returns:
- The resulting graph structure.
- Throws:
- IllegalArgumentException- if the time lag is greater than 0 and the data model is not an instance of DataSet.
- InterruptedException
 
- 
getComparisonGraphRetrieves a comparison graph by transforming a true directed graph into a partially directed graph (PAG).- Specified by:
- getComparisonGraphin interface- Algorithm
- Parameters:
- graph- The true directed graph, if there is one.
- Returns:
- The comparison graph.
 
- 
getDescriptionReturns a short, one-line description of this algorithm. The description is generated by concatenating the descriptions of the test and score objects associated with this algorithm.- Specified by:
- getDescriptionin interface- Algorithm
- Returns:
- The description of this algorithm.
 
- 
getDataTypeRetrieves the data type required by the search algorithm.- Specified by:
- getDataTypein interface- Algorithm
- Returns:
- The data type required by the search algorithm.
 
- 
getParametersRetrieves the list of parameters used by the algorithm.- Specified by:
- getParametersin interface- HasParameters
- Returns:
- The list of parameters used by the algorithm.
 
- 
getKnowledgeRetrieves the knowledge object associated with this method.- Specified by:
- getKnowledgein interface- HasKnowledge
- Returns:
- The knowledge object.
 
- 
setKnowledgeSets the knowledge object associated with this method.- Specified by:
- setKnowledgein interface- HasKnowledge
- Parameters:
- knowledge- the knowledge object to be set
 
- 
getScoreWrapperRetrieves the ScoreWrapper object associated with this method.- Specified by:
- getScoreWrapperin interface- UsesScoreWrapper
- Returns:
- The ScoreWrapper object associated with this method.
 
- 
setScoreWrapperSets the score wrapper for the algorithm.- Specified by:
- setScoreWrapperin interface- UsesScoreWrapper
- Parameters:
- score- the score wrapper.
 
- 
getIndependenceWrapperRetrieves the IndependenceWrapper object associated with this instance.- Specified by:
- getIndependenceWrapperin interface- TakesIndependenceWrapper
- Returns:
- The IndependenceWrapper object that represents the independence test used.
 
- 
setIndependenceWrapperSets the IndependenceWrapper object for this algorithm. The IndependenceWrapper represents the independence test to be used in the algorithm's operations.- Specified by:
- setIndependenceWrapperin interface- TakesIndependenceWrapper
- Parameters:
- independenceWrapper- the IndependenceWrapper object to set
 
 
-