Uses of Interface
edu.cmu.tetrad.algcomparison.algorithm.Algorithm
Packages that use Algorithm
Package
Description
This package contains utility classes for causal graph search algorithms.
-
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm
Subinterfaces of Algorithm in edu.cmu.tetrad.algcomparison.algorithmModifier and TypeInterfaceDescriptioninterfaceImplements an algorithm that takes multiple data sets as input.Classes in edu.cmu.tetrad.algcomparison.algorithm that implement AlgorithmModifier and TypeClassDescriptionclassThis is a base class for bootstrap algorithms.classA base class for bootstrapping multi-dataset algorithms (such as IMaGES), parallel toAbstractBootstrapAlgorithmfor single-dataset algorithms.classTags an an algorithm that loads up external graphs for inclusion in reports.classFirst inflection point.classStability selection: runs the wrapped algorithm on resamples of the data and returns the graph containing exactly those edges (with orientation) appearing in more than "percentStability" of the resample graphs.classStARS (Stability Approach to Regularization Selection): selects a value for one numeric parameter of a wrapped algorithm by sweeping the parameter over [low, high] in steps of 0.5, measuring the StARS adjacency instability of the algorithm's output over a fixed set of resamples at each value, choosing the value with the largest instability strictly below the cutoff (Params "StARS.cutoff"), and then running the wrapped algorithm on the full data at the chosen value.Methods in edu.cmu.tetrad.algcomparison.algorithm that return AlgorithmModifier and TypeMethodDescriptionstatic AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass, Graph externalGraph) Creates an algorithm.Methods in edu.cmu.tetrad.algcomparison.algorithm that return types with arguments of type AlgorithmMethods in edu.cmu.tetrad.algcomparison.algorithm with parameters of type AlgorithmMethod parameters in edu.cmu.tetrad.algcomparison.algorithm with type arguments of type AlgorithmModifier and TypeMethodDescriptionstatic AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass) Creates an algorithm.static AlgorithmAlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass, Graph externalGraph) Creates an algorithm.Constructors in edu.cmu.tetrad.algcomparison.algorithm with parameters of type AlgorithmModifierConstructorDescriptionFirstInflection(Algorithm algorithm, String parameter, double low, double high, double increment) Constructor for FirstInflection.StabilitySelection(Algorithm algorithm) Constructor for StabilitySelection.Constructor for StARS. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that implement AlgorithmModifier 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.Methods in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag with parameters of type AlgorithmModifier and TypeMethodDescriptionvoidFask.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidFaskOrig.setExternalGraph(Algorithm algorithm) Deprecated.Sets the external graph to be used by the algorithm. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.multi
Classes in edu.cmu.tetrad.algcomparison.algorithm.multi that implement AlgorithmModifier and TypeClassDescriptionclassWraps the IMaGES algorithm for continuous variables.classWraps the pooled-FASK multi-dataset algorithm for continuous variables.classWraps the MultiFask algorithm for continuous variables.classRuns FCI on multiple datasets using the IOD pooled dataset independence test.classRequires that the parameter 'randomSelectionSize' be set to indicate how many datasets should be taken at a time (randomly).classWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables.classWraps the IMaGES algorithm for continuous variables.classRuns the ION (Integration of Overlapping Networks) algorithm on multiple datasets whose variable sets may overlap only partially.Methods in edu.cmu.tetrad.algcomparison.algorithm.multi with parameters of type AlgorithmModifier and TypeMethodDescriptionvoidFaskPool.setExternalGraph(Algorithm algorithm) setExternalGraph.voidFaskVote.setExternalGraph(Algorithm algorithm) setExternalGraph.Constructors in edu.cmu.tetrad.algcomparison.algorithm.multi with parameters of type AlgorithmModifierConstructorDescriptionFgesConcatenated(ScoreWrapper score, Algorithm externalGraph) Constructor for FgesConcatenated. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement AlgorithmModifier 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).classCstar class.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.classPCMCI wrapper for algcomparison.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.classPC.classSP (Sparsest Permutation)classDeprecated.classAlgorithm-comparison wrapper for the Trek-MIMIC search.classDeprecated. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that implement AlgorithmModifier 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 Algorithm in edu.cmu.tetrad.algcomparison.algorithm.other
Classes in edu.cmu.tetrad.algcomparison.algorithm.other that implement AlgorithmModifier and TypeClassDescriptionclassFactor analysis.classGLASSO.classMimbuild Bollen.classMimbuild PCA.classDeprecated.classWrapper for the RLCD algorithm (Rank-based Latent Causal Discovery; Dong et al., ICLR 2024), which learns a graph over the observed variables and newly introduced latent variables from rank constraints on the covariance matrix. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.pairwise
Classes in edu.cmu.tetrad.algcomparison.algorithm.pairwise that implement AlgorithmModifier and TypeClassDescriptionclassFASK-PW (pairwise).classR1.classR2.classR3.classRSkew.classRSkewE.classSkew.classSkewE.classTanh.Methods in edu.cmu.tetrad.algcomparison.algorithm.pairwise with parameters of type AlgorithmModifier and TypeMethodDescriptionvoidFaskPw.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidR1.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.voidR2.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.voidR3.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidRskew.setExternalGraph(Algorithm algorithm) Sets the external graph for this algorithm.voidRskewE.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.voidSkew.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidSkewE.setExternalGraph(Algorithm algorithm) Sets the external graph to be used by the algorithm.voidTanh.setExternalGraph(Algorithm algorithm) Sets the external graph for the algorithm.Constructors in edu.cmu.tetrad.algcomparison.algorithm.pairwise with parameters of type AlgorithmModifierConstructorDescriptionConstructor for FaskPw.Constructor for R1.Constructor for R2.Constructor for R3.Constructor for Rskew.Constructor for RskewE.Constructor for Skew.Constructor for SkewE.Constructor for Tanh. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.sweep
Methods in edu.cmu.tetrad.algcomparison.sweep with parameters of type AlgorithmModifier and TypeMethodDescriptionParameterSweep.searchOnResamples(Algorithm algorithm, Parameters parameters, List<DataSet> resamples, List<Node> variables, boolean parallelized) Runs the algorithm at the given parameters on each resample and returns the graphs, with nodes replaced by the given variable list so graphs are comparable.Constructors in edu.cmu.tetrad.algcomparison.sweep with parameters of type AlgorithmModifierConstructorDescriptionParameterSweep(Algorithm algorithm, Parameters baseParameters) Constructs a sweep harness for the given algorithm and base parameters. -
Uses of Algorithm in edu.cmu.tetrad.algcomparison.utils
Methods in edu.cmu.tetrad.algcomparison.utils with parameters of type AlgorithmModifier and TypeMethodDescriptionstatic StringParameterSettingsText.render(Algorithm algorithm, Parameters parameters, boolean sourceGraphSupplied) Renders the settings for the given configured algorithm.voidTakesExternalGraph.setExternalGraph(Algorithm algorithm) setExternalGraph. -
Uses of Algorithm in edu.cmu.tetrad.data.missing
Methods in edu.cmu.tetrad.data.missing with parameters of type AlgorithmModifier and TypeMethodDescriptionstatic ImputationSearch.ResultImputationSearch.search(DataSet dataSet, Algorithm algorithm, Parameters parameters, MultipleImputer imputer, MissingDataSpec spec) Runs the multiple-imputation search. -
Uses of Algorithm in edu.cmu.tetrad.search.utils
Methods in edu.cmu.tetrad.search.utils with parameters of type AlgorithmModifier and TypeMethodDescriptionstatic booleanGraphSearchUtils.isLatentVariableAlgorithmByAnnotation(Algorithm algorithm) Checks if the provided algorithm is a latent variable algorithm by inspecting the associated annotation. -
Uses of Algorithm in edu.cmu.tetrad.util
Methods in edu.cmu.tetrad.util with parameters of type AlgorithmModifier and TypeMethodDescriptionParams.getAlgorithmParameters(Algorithm algorithm) getAlgorithmParameters.Params.getBootstrappingParameters(Algorithm algorithm) getBootstrappingParameters.Params.getScoreParameters(Algorithm algorithm) getScoreParameters.Params.getTestParameters(Algorithm algorithm) getTestParameters.