Uses of Interface
edu.cmu.tetrad.search.IGraphSearch
Packages that use IGraphSearch
Package
Description
This package contains classes for causal graph search algorithms.
This package contains classes for testing causal graph search algorithms.
This package contains utility classes for causal graph search algorithms.
A package for algorithms that are not ready for prime time.
-
Uses of IGraphSearch in edu.cmu.tetrad.search
Subinterfaces of IGraphSearch in edu.cmu.tetrad.searchModifier and TypeInterfaceDescriptioninterfaceThe IFas interface represents a framework for performing fast adjacency search in graph structures.Classes in edu.cmu.tetrad.search that implement IGraphSearchModifier and TypeClassDescriptionfinal classUses BOSS in the *-FCI algorithm.final classfinal classBFCI-Bryan-Score:BfciBryanwith a SCORING STEP added to every gated move, following Bryan Andrews's pseudocode "BFCI-Bryan with scoring".final classUses BOSS in the sepset-projection *-FCI variant; seeStarFciC.final classUses BOSS in the sepset-projection-with-R4-fallback *-FCI variant; seeStarFciD.final classEXPERIMENTAL: BFCI with a per-removal SCORE CHECK ("tests propose, scores dispose").final classBOSS-CCD: Cyclic Causal Discovery (Richardson's CCD) with the adjacency phase delegated to BOSS.final classCyclic Causal Discovery (CCD) after Richardson.final classImplements the CD-NOD (Causal Discovery from Non-stationary/heterogeneous Data) algorithm, which learns a causal graph from data in the presence of context variables that index changing causal mechanisms across data segments or environments.final classImplements a variant of the CD-NOD (Causal Discovery from Non-stationary/ heterogeneous Data) algorithm that uses BOSS (Best Order Score Search) for the backbone rather than FAS.classImplements the Fast Adjacency Search (FAS), which is the adjacency search of the PC algorithm (see).classAdjusts FAS (see) for the deterministic case by refusing to removed edges based on conditional independence tests that are judged to be deterministic.final classDeprecated.final classThe Fci class implements the Fast Causal Inference (FCI) algorithm for discovering causal structures from data.final classThe FCI Targeted Testing (FCIT) algorithm: learns a PAG from observational data with latent variables.final classThe FCI Targeted Testing (FCIT) algorithm: learns a PAG from observational data with latent variables.final classThe FCI Targeted Testing (FCIT) algorithm: learns a PAG from observational data with latent variables.final classA Markov-preserving variant ofFcitZm.final classA Markov-preserving variant ofFcit.final classFCIT-SL ("Step Lemma"): FCIT-ZM extended with a Step-Lemma-guided representative search.final classFCIT-SL ("Step Lemma"): FCIT-ZM extended with a Step-Lemma-guided representative search.final classKEEP-KNOWLEDGE VARIANT. This class is the knowledge-orientation-keeping variant of FcitSl, parallel to StarFciKeepKnowledgeOrientations and FcitKeepKnowledgeOrientations.final classFCIT-SL-SCORE-CHECK:FcitSlwith a MAG SCORE CHECK on every candidate the search adjudicates.final classFCIT with a MAG-side legality gate.final classFCIT with a MAG-side legality gate.final classFCIT with a MAG-side legality gate.classImplements the Fast Greedy Equivalence Search (FGES) algorithm.final classUses FGES for the initial step of *-FCI.classImplements the GFCI (Greedy Fast Causal Inference) algorithm as described in:final classGMAS: a latent-variable search that uses NO independence tests at all.final classUses GRaSP in the *-FCI algorithm.final classImplements the Iterative Causal Discovery (ICD) algorithm for learning a Partial Ancestral Graph (PAG) from observational data.final classLV-Heuristic is a class that implements the IGraphSearch interface.classImplements the PC (Peter–Clark) causal discovery algorithm for learning a causal graph from conditional independence information.classImplements the PC (Peter–Clark) causal discovery algorithm for learning a causal graph from conditional independence information.classModifies the PC algorithm to handle the deterministic case.final classSearches for a CPDAG representing all the Markov blankets for a given target T consistent with the given independence information.final classPCMCI (Runge et al.) — minimal, time-series implementation with lagged edges only (τ≥1).final classImplements the Really Fast Causal Inference (RFCI) algorithm, which aims to do a correct inference of inferrable causal structure under the assumption that unmeasured common causes of variables in the data may exist.final classUses SP in place of FGES for the initial step in the *-FCI algorithm.class*-FCI (StarFCI): the shipping latent-variable search of the StarFCI paper (Ramsey, Andrews, and Spirtes), in the sepset-map-as-state formulation due to Bryan Andrews.class*-FCI (StarFCI): the GFCI-template latent-variable search of the StarFCI paper (Ramsey, Andrews, and Spirtes, "StarFCI: A GFCI-Template Latent-Variable Search that Returns a PAG by Construction"), with the Markov-CPDAG initializer abstracted (StarFciB.getMarkovCpdag(boolean)) and supplied by subclasses:Gfci(from FGES),Bfci(from BOSS),GraspFci(from GRaSP),SpFci(from SP).classEXPERIMENTAL VARIANT (2026-10-19): StarFci with the PAG inference replaced by SEPSET PROJECTION.classEXPERIMENTAL VARIANT (2026-10-19): StarFciC (sepset projection) PLUS the recursive-blocking R4 fallback.classDeprecated.classDeprecated.The knowledge handling of this class has been consolidated intoStarFci(formerly StarFciGuaranteePag); with empty knowledge the two already coincided.classORIGINAL *-FCI implementation (CPDAG-collider copy plus sepset stamps, frozen sepsets, saturating step, gated or ungated), preserved under this name on 2026-10-21 whenStarFciwas replaced by the sepset-projection / re-selection formulation (formerlyBfciBryan).classDeprecated.final classGreedy local-search model-repair algorithm for causal graphs. -
Uses of IGraphSearch in edu.cmu.tetrad.search.is
Classes in edu.cmu.tetrad.search.is that implement IGraphSearch -
Uses of IGraphSearch in edu.cmu.tetrad.search.mimic
Classes in edu.cmu.tetrad.search.mimic that implement IGraphSearchModifier and TypeClassDescriptionfinal classDeprecated.classImplements a Murray-Watters/Glymour style Detect-Mimic search ("DM").classA hybrid detect-mimic heuristic.classA more robust detect-mimic heuristic for MIMIC-like structures. -
Uses of IGraphSearch in edu.cmu.tetrad.search.test
Methods in edu.cmu.tetrad.search.test with parameters of type IGraphSearchModifier and TypeMethodDescriptionstatic GraphIndTestFdrWrapper.doFdrLoop(IGraphSearch search, boolean negativelyCorrelated, double alpha, double fdrQ, boolean verbose) Executes a loop for controlling the false discovery rate (FDR) as part of a graph search process. -
Uses of IGraphSearch in edu.cmu.tetrad.search.utils
Classes in edu.cmu.tetrad.search.utils that implement IGraphSearchModifier and TypeClassDescriptionfinal classThis Orients a given undirected graph such that the edges in the graph are a superset of the edges in the oriented graph, using FGES method. -
Uses of IGraphSearch in edu.cmu.tetrad.search.work_in_progress
Classes in edu.cmu.tetrad.search.work_in_progress that implement IGraphSearchModifier and TypeClassDescriptionclassDeprecated.classImplements the MMHC algorithm.final classImplements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.final classImplements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.final classImplements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.final classImplements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.final classImplements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally. -
Uses of IGraphSearch in edu.pitt.dbmi.algo.bayesian.constraint.search
Classes in edu.pitt.dbmi.algo.bayesian.constraint.search that implement IGraphSearchModifier and TypeClassDescriptionclassJan 29, 2023 4:10:52 PMclassImplements the RFCI-BSC (Really Fast Causal Inference with Bayesian Scoring of Constraints) algorithm for learning PAGs (Partial Ancestral Graphs) from discrete data with probabilistic uncertainty quantification.
StarFciOriginal; extendStarFciinstead.