Uses of Annotation Interface
edu.cmu.tetrad.annotation.Algorithm

Packages that use Algorithm

Package	Description
edu.cmu.tetrad.algcomparison.algorithm.cluster
edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
edu.cmu.tetrad.algcomparison.algorithm.multi
edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
edu.cmu.tetrad.algcomparison.algorithm.pairwise
edu.cmu.tetrad.annotation

Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.cluster

Classes in edu.cmu.tetrad.algcomparison.algorithm.cluster with annotations of type Algorithm

Modifier and Type	Class	Description
class	Bpc	Build Pure Clusters.
class	Fofc	Find One Factor Clusters.
class	Ftfc	FTFC.

Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag

Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag with annotations of type Algorithm

Modifier and Type	Class	Description
class	Dagma	Implements the DAGMA algorithm.
class	DirectLingam	Direct LiNGAM.
class	Fask	FASK algorithm.
class	IcaLingam	IcaLingam class implements the Algorithm and ReturnsBootstrapGraphs interface.
class	IcaLingD	IcaLingD is an implementation of the Algorithm interface that performs the ICA-LiNG-D algorithm for discovering causal models for the linear non-Gaussian case where the underlying model might be cyclic.

Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.multi

Classes in edu.cmu.tetrad.algcomparison.algorithm.multi with annotations of type Algorithm

Modifier and Type	Class	Description
class	FaskVote	Wraps the MultiFask algorithm for continuous variables.
class	FciIod	Runs FCI on multiple datasets using the IOD pooled dataset independence test.
class	Images	Wraps the IMaGES algorithm for continuous variables.
class	ImagesBoss	Wraps the IMaGES algorithm for continuous variables.

Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag

Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag with annotations of type Algorithm

Modifier and Type	Class	Description
class	Boss	BOSS (Best Order Score Search)
class	Cpc	Conservative PC (CPC).
class	Cstar	Cstar class.
class	Fas	Fast Adjacency Search (FAS)--i.e., the PC adjacency step, which is used in many algorithms.
class	Fges	FGES (the heuristic version).
class	FgesMb	FGES-MB (the heuristic version).
class	Grasp	GRaSP (Greedy Relaxations of Sparsest Permutation)
class	Pc	Peter/Clark algorithm (PC).
class	PcMax	PC-Max.
class	PcMb	PC.
class	Sp	SP (Sparsest Permutation)

Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag

Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag with annotations of type Algorithm

Modifier and Type	Class	Description
class	BossDot	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	BossFci	Adjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.
class	Ccd	CCD (Cyclic Causal Discovery)
class	Cfci	Conservative FCI.
class	DmFcit	This class represents the Detect-Mimic-FCIT (DM-FCIT) algorithm, a specialized variant of the DM-PC and FCIT algorithms designed to identify intermediate latent variables.
class	DmPc	Detect-Mimic-PC (DM-PC) algorithm.
class	Fci	The Fast Causal Inference (FCI) algorithm.
class	FciMax	FCI-Max algorithm.
class	Fcit	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	Gfci	The GFCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.
class	GraspFci	GRaSP-FCI, an implentatation of *-FCI using GRaSP.
class	PagSampleRfci	Jan 29, 2023 3:45:09 PM
class	Rfci	RFCI.
class	RfciBsc	Runs RFCI-BSC, which is RFCI with bootstrap sampling of PAGs.
class	SpFci	Adjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.
class	SvarFci	The SvarFci class is an implementation of the SVAR Fast Causal Inference algorithm.
class	SvarGfci	SvarGfci class is an implementation of the SVAR GFCI algorithm.

Uses of Algorithm in edu.cmu.tetrad.algcomparison.algorithm.pairwise

Classes in edu.cmu.tetrad.algcomparison.algorithm.pairwise with annotations of type Algorithm

Modifier and Type	Class	Description
class	FaskPw	FASK-PW (pairwise).
class	R3	R3.
class	Rskew	RSkew.
class	Skew	Skew.

Uses of Algorithm in edu.cmu.tetrad.annotation

Methods in edu.cmu.tetrad.annotation that return types with arguments of type Algorithm

Modifier and Type	Method	Description
List<AnnotatedClass<Algorithm>>	AlgorithmAnnotations.filterOutExperimental(List<AnnotatedClass<Algorithm>> list)	Filters out algorithms that are not for the given data type.

Method parameters in edu.cmu.tetrad.annotation with type arguments of type Algorithm

Modifier and Type	Method	Description
List<AnnotatedClass<Algorithm>>	AlgorithmAnnotations.filterOutExperimental(List<AnnotatedClass<Algorithm>> list)	Filters out algorithms that are not for the given data type.