Uses of Interface
edu.cmu.tetrad.algcomparison.utils.TakesScoreWrapper

Packages that use TakesScoreWrapper
  • Uses of TakesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag

    Modifier and Type
    Class
    Description
    class 
    Direct LiNGAM.
    class 
    FASK algorithm.
    class 
    Deprecated.
  • Uses of TakesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.multi

    Modifier and Type
    Class
    Description
    class 
    Wraps the pooled-FASK multi-dataset algorithm for continuous variables.
    class 
    Wraps the MultiFask algorithm for continuous variables.
    class 
    Wraps the IMaGES algorithm for continuous variables.
    class 
    Wraps the IMaGES algorithm for continuous variables.
    class 
    Wraps the IMaGES algorithm for continuous variables.
    class 
    Runs the ION (Integration of Overlapping Networks) algorithm on multiple datasets whose variable sets may overlap only partially.
  • Uses of TakesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag

    Modifier and Type
    Class
    Description
    class 
    BOSS (Best Order Score Search)
    class 
    BOSS + score-based CD-NOD context augmentation.
    class 
    BOSS-TopK (Best Order Score Search, Top K).
    class 
    Algcomparison 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.
    class 
    CD-NOD wrapper for algcomparison.
    class 
    Cstar class.
    class 
    FGES (the heuristic version).
    class 
    FGES-MB (the heuristic version).
    class 
    GRaSP (Greedy Relaxations of Sparsest Permutation)
    class 
    Implements a restricted version of the BOSS (Best Order Score Search) algorithm that focuses search on a set of target variables and their immediate causes.
    class 
    SP (Sparsest Permutation)
  • Uses of TakesScoreWrapper in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag

    Modifier and Type
    Class
    Description
    class 
    Adjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.
    class 
    BFCI-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.
    class 
    BFCI-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.
    class 
    Adjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.
    class 
    Adjusts 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 sessions
    class 
    BOSS-CCD (Cyclic Causal Discovery with a BOSS adjacency superstructure).
    class 
    BOSS-FCI, the former name of BFCI.
    class 
    BOSS-POD, removed in Tetrad 8.0.0.
    class 
    DM-FCIT, removed in Tetrad 8.0.0.
    class 
    This 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.
    class 
    This 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.
    class 
    This 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.
    class 
    This 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.
    class 
    FCIT-SL-Score-Check: the FCIT-SL algorithm with a MAG BIC SCORE CHECK applied to every candidate the search adjudicates.
    class 
    This 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.
    class 
    The Fges-FCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.
    class 
    The GFCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.
    class 
    GMAS: a latent-variable search that uses no independence tests.
    class 
    GRaSP-FCI, an implentatation of *-FCI using GRaSP.
    class 
    This class represents the FCIT algorithm, which is an implementation of the FGES-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    class 
    Adjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.