Uses of Interface
edu.cmu.tetrad.algcomparison.utils.UsesScoreWrapper
Packages that use UsesScoreWrapper
Package
Description
-
Uses of UsesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that implement UsesScoreWrapperModifier and TypeClassDescriptionclassDirect LiNGAM.classFASK algorithm.classThe FaskOrig class is an implementation of the FASK-Orig algorithm for causal discovery. -
Uses of UsesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.multi
Classes in edu.cmu.tetrad.algcomparison.algorithm.multi that implement UsesScoreWrapperModifier and TypeClassDescriptionclassWraps the MultiFask algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables. -
Uses of UsesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement UsesScoreWrapperModifier and TypeClassDescriptionclassBOSS (Best Order Score Search)classBOSS-LiNGAM algorithm.classCstar class.classFGES (the heuristic version).classFGES-MB (the heuristic version).classGRaSP (Greedy Relaxations of Sparsest Permutation)classBOSS-DC (Best Order Score Search Divide and Conquer)classSP (Sparsest Permutation) -
Uses of UsesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that implement UsesScoreWrapperModifier 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.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.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.classAdjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.classSvarGfci class is an implementation of the SVAR GFCI algorithm.