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 TakesIndependenceWrapper -
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.classRuns FCI on multiple datasets using the IOD pooled dataset independence test.classRuns the ION (Integration of Overlapping Networks) algorithm on multiple datasets whose variable sets may overlap only partially. -
Uses of TakesIndependenceWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement TakesIndependenceWrapperModifier and TypeClassDescriptionclassCD-NOD wrapper for algcomparison.classAlgcomparison wrapper for the CD-NOD-BOSS search (CdnodBoss): a BOSS backbone with constraint-based collider orientation applied only to unshielded triples that BOSS leaves fully undirected, followed by Meek closure.classCD-NOD wrapper for algcomparison.classConservative 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).classPeter/Clark algorithm with adjacency-rescue (PcAR): PC augmented with detection, and optionally repair, of cancelled unfaithful-triangle edges.classPC-Max.classPC.classPCMCI wrapper for algcomparison. -
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 FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.classBFCI-Bryan: BOSS followed by the from-scratch, sepset-map-as-state formulation of the gated StarFCI extra-edge-removal step, with sepset RE-SELECTION (a gate-rejected separating set does not retire the pair; the next separating set is tried) and NO saturating step.classBFCI-Bryan-Score: BFCI-Bryan (sepset re-selection under the legality gate) with a scoring step: a legal candidate is committed only if the RICF Gaussian BIC of its MAG strictly improves on the committed model's, following Bryan Andrews's "BFCI-Bryan with scoring" pseudocode.classAdjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.classAdjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.class/ Hidden from the interface on 2026-10-21 (no @Algorithm annotation): kept only so that saved sessionsclassBOSS-CCD (Cyclic Causal Discovery with a BOSS adjacency superstructure).classBOSS-FCI, the former name of BFCI.classCCD (Cyclic Causal Discovery)classCFCI (Conservative FCI).classImplements the CPW (Cyclic Pairwise) algorithm for causal discovery from continuous, causally sufficient observational data.classAlgorithm-comparison wrapper for the Murray-Watters/Glymour style Detect-Mimic search, DM.classDM-FCIT, removed in Tetrad 8.0.0.classDM-PC, removed in Tetrad 8.0.0.classThe Fast Causal Inference (FCI) algorithm.classFCI-CPW: Run FCI with internally constructed PW-forbidden knowledge, then orient edges using a pairwise left-right rule on standardized data in cases that are safe under no-selection-bias cyclic semantics: Tail–tail (—) edges Orient per pairwise rule. Tail–circle (—o) edges If pairwise prefers x→y, set x→y (symmetrically, if prefers y→x, set y→x). Circle–circle (o–o) edges If pairwise prefers x→y, set x o→y (symmetrically for y→x).classFCI-Max.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.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.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.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.classFCIT-SL-Score-Check: the FCIT-SL algorithm with a MAG BIC SCORE CHECK applied to every candidate the search adjudicates.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.classThe Iterative Causal Discovery (ICD) algorithm.classIS-GFCI (Instance-Specific GFCI) wrapper for the algcomparison interface.classRFCI.classAdjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.