Uses of Interface
edu.cmu.tetrad.search.IGraphSearch

Packages that use IGraphSearch

Package	Description
edu.cmu.tetrad.search	This package contains classes for causal graph search algorithms.
edu.cmu.tetrad.search.test	This package contains classes for testing causal graph search algorithms.
edu.cmu.tetrad.search.utils	This package contains utility classes for causal graph search algorithms.
edu.cmu.tetrad.search.work_in_progress	A package for algorithms that are not ready for prime time.
edu.pitt.dbmi.algo.bayesian.constraint.search

Uses of IGraphSearch in edu.cmu.tetrad.search

Subinterfaces of IGraphSearch in edu.cmu.tetrad.search

Modifier and Type	Interface	Description
interface	IFas	The IFas interface represents a framework for performing fast adjacency search in graph structures.

Classes in edu.cmu.tetrad.search that implement IGraphSearch

Modifier and Type	Class	Description
final class	BossFci	Uses BOSS in the *-FCI algorithm.
final class	BossPod	BOSS-POD is a class that implements the IGraphSearch interface.
final class	Ccd	Cyclic Causal Discovery (CCD) after Richardson.
final class	Cdnod	The Cdnod class implements the causal discovery algorithm for detecting changing dependencies with respect to a change index variable in a dataset.
final class	Cfci	Deprecated.
class	DmPc	The Detect-Mimic-PC (DM-PC) algorithm.
class	Fas	Implements the Fast Adjacency Search (FAS), which is the adjacency search of the PC algorithm (see).
class	Fasd	Adjusts FAS (see) for the deterministic case by refusing to removed edges based on conditional independence tests that are judged to be deterministic.
final class	FaskOrig	Implements the FASK (Fast Adjacency Skewness) algorithm, which makes decisions for adjacency and orientation using a combination of conditional independence testing, judgments of nonlinear adjacency, and pairwise orientation due to non-Gaussianity.
final class	Fci	The Fci class implements the Fast Causal Inference (FCI) algorithm for discovering causal structures from data.
final class	FciMax	Deprecated.
final class	Fcit	The FCI Targeted Testing (FCIT) algorithm implements a search algorithm for learning the structure of a graphical model from observational data with latent variables.
class	Fges	Implements the Fast Greedy Equivalence Search (FGES) algorithm.
final class	FgesFci	Uses FGES for the initial step of *-FCI.
class	Gfci	*-FCI implements a template modification of GFCI that starts with a given Markov CPDAG and then fixes that result to be correct for latent variables models.
final class	GraspFci	Uses GRaSP in the *-FCI algorithm.
class	IsFges	Instance-Specific FGES: overrides just the bump computations to use ISScore, while the FGES base still runs the rest of the algorithm (caching, Meek, BES).
final class	IsGFci	Implements instance-specific FGES-FCI, following the idea introduced by Fattaneh Jabbari in her dissertation (pp.
class	Pc	Pc (Unified "Classic PC")
class	Pcd	Modifies the PC algorithm to handle the deterministic case.
final class	PcMb	Searches for a CPDAG representing all the Markov blankets for a given target T consistent with the given independence information.
final class	Pcmci	PCMCI (Runge et al.) — minimal, time-series implementation with lagged edges only (τ≥1).
final class	Rfci	Implements 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 class	SpFci	Uses SP in place of FGES for the initial step in the *-FCI algorithm.
class	StarFci	*-FCI implements a template modification of GFCI that starts with a given Markov CPDAG and then fixes that result to be correct for latent variables models.

Uses of IGraphSearch in edu.cmu.tetrad.search.test

Methods in edu.cmu.tetrad.search.test with parameters of type IGraphSearch

Modifier and Type	Method	Description
static Graph	IndTestFdrWrapper.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 IGraphSearch

Modifier and Type	Class	Description
final class	FgesOrienter	This 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 IGraphSearch

Modifier and Type	Class	Description
final class	FasLofs	Runs Fast Adjacency Search (FAS) and then orients each edge using the robust skew orientation algorithm.
class	Kpc	Deprecated.
class	Mmhc	Implements the MMHC algorithm.
final class	SampleVcpc	Implements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
final class	SampleVcpcFast	Implements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
final class	VcPc	Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
final class	VcPcAlt	Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
final class	VcPcFast	Implements 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 IGraphSearch

Modifier and Type	Class	Description
class	PagSamplingRfci	Jan 29, 2023 4:10:52 PM
class	RfciBsc	Dec 17, 2018 3:28:15 PM