Uses of Interface
edu.cmu.tetrad.algcomparison.utils.TakesIndependenceWrapper
Packages that use TakesIndependenceWrapper
Package
Description
-
Uses of TakesIndependenceWrapper in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that implement TakesIndependenceWrapperModifier and TypeClassDescriptionclassThe FaskOrig class is an implementation of the FASK-Orig algorithm for causal discovery. -
Uses of TakesIndependenceWrapper in edu.cmu.tetrad.algcomparison.algorithm.multi
Classes in edu.cmu.tetrad.algcomparison.algorithm.multi that implement TakesIndependenceWrapperModifier and TypeClassDescriptionclassWraps the IMaGES algorithm for continuous variables.classWraps the MultiFask algorithm for continuous variables.classRuns FCI on multiple datasets using the IOD pooled dataset independence test. -
Uses of TakesIndependenceWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement TakesIndependenceWrapperModifier and TypeClassDescriptionclassConservative PC (CPC).classCstar class.classFast Adjacency Search (FAS)--i.e., the PC adjacency step, which is used in many algorithms.classGRaSP (Greedy Relaxations of Sparsest Permutation)classPeter/Clark algorithm (PC).classPC. -
Uses of TakesIndependenceWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that implement TakesIndependenceWrapperModifier and TypeClassDescriptionclassAdjusts GFCI 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.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.classRFCI.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.