Uses of Class
edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
Packages that use AbstractBootstrapAlgorithm
Package
Description
-
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm
Subclasses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithmModifier and TypeClassDescriptionclassA base class for bootstrapping multi-dataset algorithms (such as IMaGES), parallel toAbstractBootstrapAlgorithmfor single-dataset algorithms. -
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Modifier and TypeClassDescriptionclassImplements the DAGMA algorithm.classDirect LiNGAM.classFASK algorithm.classDeprecated.classICA-LiNGAM, the former name of LiNGAM.classICA-LiNG-D, the former name of LiNG-D.classIcaLingam class implements the Algorithm and ReturnsBootstrapGraphs interface.classIcaLingD is an implementation of the Algorithm interface that performs the LiNG-D algorithm for discovering causal models for the linear non-Gaussian case where the underlying model might be cyclic. -
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.multi
Subclasses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.multiModifier and TypeClassDescriptionclassWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables. -
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Modifier and TypeClassDescriptionclassBOSS (Best Order Score Search)classBOSS + score-based CD-NOD context augmentation.classBOSS-TopK (Best Order Score Search, Top K).classDeprecated.classRepresents the CAM algorithm, which is a causal additive model search algorithm.classCD-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).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).classFLOP (Fast Learning of Order and Parents).classGRaSP (Greedy Relaxations of Sparsest Permutation)classIS-FGES (Instance-Specific FGES) wrapper for the algcomparison interface.classPeter/Clark algorithm (PC).classPeter/Clark algorithm with adjacency-rescue (PcAR): PC augmented with detection, and optionally repair, of cancelled unfaithful-triangle edges.classPC.classPC-Max.classPC.classImplements a restricted version of the BOSS (Best Order Score Search) algorithm that focuses search on a set of target variables and their immediate causes.classSP (Sparsest Permutation)classDeprecated.classAlgorithm-comparison wrapper for the Trek-MIMIC search.classDeprecated. -
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Modifier 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.classBOSS-POD, removed in Tetrad 8.0.0.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.classGMAS: a latent-variable search that uses no independence tests.classGRaSP-FCI, an implentatation of *-FCI using GRaSP.classThe Iterative Causal Discovery (ICD) algorithm.classIS-GFCI (Instance-Specific GFCI) wrapper for the algcomparison interface.classWrapper for LV-BOSS: the fully score-based latent-variable search that embeds a MAG projection inside a BOSS-style search over orders, scored by the exact RICF Gaussian MAG BIC (MagRicfBicScorer).classThis 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.classPAG-Sampling-RFCI, the former name of the class now called PagSamplingRfci.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. -
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.other
Subclasses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.other -
Uses of AbstractBootstrapAlgorithm in edu.cmu.tetrad.algcomparison.algorithm.pairwise