Uses of Annotation Interface
edu.cmu.tetrad.annotation.Algorithm
Packages that use Algorithm
Package
Description
-
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.cluster
Classes in edu.cmu.tetrad.algcomparison.algorithm.cluster with annotations of type Algorithm -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag with annotations of type 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. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.mixed
Classes in edu.cmu.tetrad.algcomparison.algorithm.mixed with annotations of type Algorithm -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.multi
Classes in edu.cmu.tetrad.algcomparison.algorithm.multi with annotations of type AlgorithmModifier and TypeClassDescriptionclassWraps the MultiFask algorithm for continuous variables.classRuns FCI on multiple datasets using the IOD pooled dataset independence test.classWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag with annotations of type AlgorithmModifier and TypeClassDescriptionclassBOSS (Best Order Score Search)classBOSS-LiNGAM algorithm.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).classGRaSP (Greedy Relaxations of Sparsest Permutation)classPeter/Clark algorithm (PC).classPC.classSP (Sparsest Permutation) -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag with annotations of type AlgorithmModifier and TypeClassDescriptionclassAdjusts GFCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.classThis 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.classCCD (Cyclic Causal Discovery)classConservative FCI.classThe Fast Causal Inference (FCI) algorithm.classFCI-Max algorithm.classThe Gfci class represents the Greedy Fast Causal Inference algorithm.classAdjusts GFCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.classThis 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.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.pairwise
Classes in edu.cmu.tetrad.algcomparison.algorithm.pairwise with annotations of type Algorithm -
Uses of Algorithm in edu.cmu.tetrad.annotation
Methods in edu.cmu.tetrad.annotation that return types with arguments of type AlgorithmModifier and TypeMethodDescriptionAlgorithmAnnotations.filterOutExperimental(List<AnnotatedClass<Algorithm>> list) Filters out algorithms that are not for the given data type.Method parameters in edu.cmu.tetrad.annotation with type arguments of type AlgorithmModifier and TypeMethodDescriptionAlgorithmAnnotations.filterOutExperimental(List<AnnotatedClass<Algorithm>> list) Filters out algorithms that are not for the given data type.