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.algorithm
Subinterfaces of Algorithm in edu.cmu.tetrad.algcomparison.algorithmModifier and TypeInterfaceDescriptioninterface
Implements an algorithm that takes multiple data sets as input.Classes in edu.cmu.tetrad.algcomparison.algorithm that implement AlgorithmModifier and TypeClassDescriptionclass
This is a base class for bootstrap algorithms.class
Tags an an algorithm that loads up external graphs for inclusion in reports.class
First inflection point.class
Stability selection.class
StARSMethods in edu.cmu.tetrad.algcomparison.algorithm that return AlgorithmModifier and TypeMethodDescriptionstatic Algorithm
AlgorithmFactory.create
(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score) Creates an algorithm.static Algorithm
AlgorithmFactory.create
(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph) Creates an algorithm.static Algorithm
AlgorithmFactory.create
(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass) Creates an algorithm.static Algorithm
AlgorithmFactory.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 Algorithm
AlgorithmFactory.create
(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score) Creates an algorithm.static Algorithm
AlgorithmFactory.create
(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph) Creates an algorithm.static Algorithm
AlgorithmFactory.create
(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass) Creates an algorithm.static Algorithm
AlgorithmFactory.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.cluster
Classes in edu.cmu.tetrad.algcomparison.algorithm.cluster that implement Algorithm -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that implement AlgorithmModifier and TypeClassDescriptionclass
Implements the DAGMA algorithm.class
Direct LiNGAM.class
FASK algorithm.class
The FaskOrig class is an implementation of the FASK-Orig algorithm for causal discovery.class
IcaLingam class implements the Algorithm and ReturnsBootstrapGraphs interface.class
IcaLingD 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 TypeMethodDescriptionvoid
Fask.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm.void
FaskOrig.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.mixed
Classes in edu.cmu.tetrad.algcomparison.algorithm.mixed that implement Algorithm -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.multi
Classes in edu.cmu.tetrad.algcomparison.algorithm.multi that implement AlgorithmModifier and TypeClassDescriptionclass
Wraps the IMaGES algorithm for continuous variables.class
Wraps the IMaGES algorithm for continuous variables.class
Wraps the MultiFask algorithm for continuous variables.class
Wraps the IMaGES algorithm for continuous variables.class
Runs FCI on multiple datasets using the IOD pooled dataset independence test.class
Requires that the parameter 'randomSelectionSize' be set to indicate how many datasets should be taken at a time (randomly).class
Wraps the IMaGES algorithm for continuous variables.class
Wraps 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.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement AlgorithmModifier and TypeClassDescriptionclass
BOSS (Best Order Score Search)class
BOSS-LiNGAM algorithm.class
Conservative PC (CPC).class
Cstar class.class
Fast Adjacency Search (FAS)--i.e., the PC adjacency step, which is used in many algorithms.class
FGES (the heuristic version).class
FGES-MB (the heuristic version).class
FGES (the heuristic version).class
GRaSP (Greedy Relaxations of Sparsest Permutation)class
Peter/Clark algorithm (PC).class
PC.class
PC.class
BOSS-DC (Best Order Score Search Divide and Conquer)class
PC.class
SP (Sparsest Permutation) -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that implement AlgorithmModifier and TypeClassDescriptionclass
Adjusts GFCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.class
This class represents the LV-Lite algorithm, which is an implementation of the GFCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.class
This class represents the LV-Lite algorithm, which is an implementation of the GFCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.class
CCD (Cyclic Causal Discovery)class
Conservative FCI.class
The Fast Causal Inference (FCI) algorithm.class
FCI-Max algorithm.class
The Gfci class represents the Greedy Fast Causal Inference algorithm.class
Adjusts GFCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.class
This class represents the LV-Lite algorithm, which is an implementation of the GFCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.class
Jan 29, 2023 3:45:09 PMclass
RFCI.class
Runs RFCI-BSC, which is RFCI with bootstrap sampling of PAGs.class
Adjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.class
The SvarFci class is an implementation of the SVAR Fast Causal Inference algorithm.class
SvarGfci class is an implementation of the SVAR GFCI algorithm. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.other
Classes in edu.cmu.tetrad.algcomparison.algorithm.other that implement Algorithm -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.pairwise
Classes in edu.cmu.tetrad.algcomparison.algorithm.pairwise that implement AlgorithmModifier and TypeClassDescriptionclass
EB.class
FASK-PW (pairwise).class
R1.class
R2.class
R3.class
RSkew.class
RSkewE.class
Skew.class
SkewE.class
Tanh.Methods in edu.cmu.tetrad.algcomparison.algorithm.pairwise with parameters of type AlgorithmModifier and TypeMethodDescriptionvoid
Eb.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm.void
FaskPw.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm.void
R1.setExternalGraph
(Algorithm algorithm) Sets the external graph for the algorithm.void
R2.setExternalGraph
(Algorithm algorithm) Sets the external graph for the algorithm.void
R3.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm.void
Rskew.setExternalGraph
(Algorithm algorithm) Sets the external graph for this algorithm.void
RskewE.setExternalGraph
(Algorithm algorithm) Sets the external graph for the algorithm.void
Skew.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm.void
SkewE.setExternalGraph
(Algorithm algorithm) Sets the external graph to be used by the algorithm.void
Tanh.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.utils
Methods in edu.cmu.tetrad.algcomparison.utils with parameters of type AlgorithmModifier and TypeMethodDescriptionvoid
TakesExternalGraph.setExternalGraph
(Algorithm algorithm) setExternalGraph. -
Uses of Algorithm in edu.cmu.tetrad.search.utils
Methods in edu.cmu.tetrad.search.utils with parameters of type AlgorithmModifier and TypeMethodDescriptionstatic boolean
GraphSearchUtils.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.util
Methods 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.