Uses of Interface
edu.cmu.tetrad.algcomparison.algorithm.Algorithm
Packages that use Algorithm
Package
Description
Contains some utility classes for search algorithms.
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithmSubinterfaces of Algorithm in edu.cmu.tetrad.algcomparison.algorithmModifier and TypeInterfaceDescriptioninterfaceImplements an algorithm that takes multiple data sets as input.Classes in edu.cmu.tetrad.algcomparison.algorithm that implement AlgorithmModifier and TypeClassDescriptionclassThis is a base class for bootstrap algorithms.classTags an an algorithm that loads up external graphs for inclusion in reports.classFirst inflection point.classStability selection.classStARSMethods in edu.cmu.tetrad.algcomparison.algorithm that return AlgorithmModifier and TypeMethodDescriptionstatic AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass, Graph externalGraph) Creates an algorithm.Methods in edu.cmu.tetrad.algcomparison.algorithm that return types with arguments of type AlgorithmMethods in edu.cmu.tetrad.algcomparison.algorithm with parameters of type AlgorithmMethod parameters in edu.cmu.tetrad.algcomparison.algorithm with type arguments of type AlgorithmModifier and TypeMethodDescriptionstatic AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass, Graph externalGraph) Creates an algorithm.Constructors in edu.cmu.tetrad.algcomparison.algorithm with parameters of type AlgorithmModifierConstructorDescriptionFirstInflection(Algorithm algorithm, String parameter, double low, double high, double increment) Constructor for FirstInflection.StabilitySelection(Algorithm algorithm) Constructor for StabilitySelection.Constructor for StARS.
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.clusterClasses in edu.cmu.tetrad.algcomparison.algorithm.cluster that implement Algorithm
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.continuous.dagClasses in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that implement AlgorithmModifier and TypeClassDescriptionclassImplements the DAGMA algorithm.classDirect LiNGAM.classFASK algorithm.classThe FaskOrig class is an implementation of the FASK-Orig algorithm for causal discovery.classIcaLingam class implements the Algorithm and ReturnsBootstrapGraphs interface.classIcaLingD is an implementation of the Algorithm interface that performs the ICA-LiNG-D algorithm for discovering causal models for the linear non-Gaussian case where the underlying model might be cyclic.Methods in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag with parameters of type AlgorithmModifier and TypeMethodDescriptionvoidFask.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidFaskOrig.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.multiClasses in edu.cmu.tetrad.algcomparison.algorithm.multi that implement AlgorithmModifier and TypeClassDescriptionclassWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables.classWraps the MultiFask algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables.classRuns FCI on multiple datasets using the IOD pooled dataset independence test.classRequires that the parameter 'randomSelectionSize' be set to indicate how many datasets should be taken at a time (randomly).classWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables.Constructors in edu.cmu.tetrad.algcomparison.algorithm.multi with parameters of type AlgorithmModifierConstructorDescriptionFgesConcatenated(ScoreWrapper score, Algorithm externalGraph) Constructor for FgesConcatenated.
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdagClasses in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement AlgorithmModifier and TypeClassDescriptionclassBOSS (Best Order Score Search)classConservative PC (CPC).classCstar class.classFast Adjacency Search (FAS)--i.e., the PC adjacency step, which is used in many algorithms.classFGES (the heuristic version).classFGES-MB (the heuristic version).classFGES (the heuristic version).classGRaSP (Greedy Relaxations of Sparsest Permutation)classPeter/Clark algorithm (PC).classPC.classPC-Max.classPC.classBOSS-DC (Best Order Score Search Divide and Conquer)classPC.classSP (Sparsest Permutation)
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.pagClasses in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that implement AlgorithmModifier and TypeClassDescriptionclassThis class represents the FCIT algorithm, which is an implementation of the FGES-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.classAdjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.classCCD (Cyclic Causal Discovery)classConservative FCI.classThis 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.classThis 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.classDetect-Mimic-PC (DM-PC) algorithm.classThe Fast Causal Inference (FCI) algorithm.classFCI-Max algorithm.classThis class represents the FCI Targeted Testing (FCIT) algorithm, which is variant of the *-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.classThe Fges-FCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.classThe GFCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.classGRaSP-FCI, an implentatation of *-FCI using GRaSP.classJan 29, 2023 3:45:09 PMclassRFCI.classRuns RFCI-BSC, which is RFCI with bootstrap sampling of PAGs.classAdjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.classThe SvarFci class is an implementation of the SVAR Fast Causal Inference algorithm.classSvarGfci class is an implementation of the SVAR GFCI algorithm.
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.otherClasses in edu.cmu.tetrad.algcomparison.algorithm.other that implement Algorithm
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.pairwiseClasses in edu.cmu.tetrad.algcomparison.algorithm.pairwise that implement AlgorithmModifier and TypeClassDescriptionclassEB.classFASK-PW (pairwise).classR1.classR2.classR3.classRSkew.classRSkewE.classSkew.classSkewE.classTanh.Methods in edu.cmu.tetrad.algcomparison.algorithm.pairwise with parameters of type AlgorithmModifier and TypeMethodDescriptionvoidEb.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidFaskPw.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidR1.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.voidR2.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.voidR3.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidRskew.setExternalGraph(Algorithm algorithm) Sets the external graph for this algorithm.voidRskewE.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.voidSkew.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidSkewE.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidTanh.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.Constructors in edu.cmu.tetrad.algcomparison.algorithm.pairwise with parameters of type AlgorithmModifierConstructorDescriptionConstructor for Eb.Constructor for FaskPw.Constructor for R1.Constructor for R2.Constructor for R3.Constructor for Rskew.Constructor for RskewE.Constructor for Skew.Constructor for SkewE.Constructor for Tanh.
- 
Uses of Algorithm in edu.cmu.tetrad.algcomparison.utilsMethods in edu.cmu.tetrad.algcomparison.utils with parameters of type AlgorithmModifier and TypeMethodDescriptionvoidTakesExternalGraph.setExternalGraph(Algorithm algorithm) setExternalGraph.
- 
Uses of Algorithm in edu.cmu.tetrad.search.utilsMethods in edu.cmu.tetrad.search.utils with parameters of type AlgorithmModifier and TypeMethodDescriptionstatic booleanGraphSearchUtils.isLatentVariableAlgorithmByAnnotation(Algorithm algorithm) Checks if the provided algorithm is a latent variable algorithm by inspecting the associated annotation.
- 
Uses of Algorithm in edu.cmu.tetrad.utilMethods in edu.cmu.tetrad.util with parameters of type AlgorithmModifier and TypeMethodDescriptionParams.getAlgorithmParameters(Algorithm algorithm) getAlgorithmParameters.Params.getBootstrappingParameters(Algorithm algorithm) getBootstrappingParameters.Params.getScoreParameters(Algorithm algorithm) getScoreParameters.Params.getTestParameters(Algorithm algorithm) getTestParameters.