Uses of Interface
edu.cmu.tetrad.util.TetradSerializable
Packages that use TetradSerializable
Package
Description
This package contains classes for causal graph search algorithms.
This package contains classes for scoring causal graph models.
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.
Contains an editable display graph for (small) lag graphs.
Implements a time-series simulation engine suitable for time-series gene
expression
studies.
Contains classes for generating simulations of expression levels over a
collection
of genes.
-
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison
Classes in edu.cmu.tetrad.algcomparison that implement TetradSerializableModifier and TypeClassDescriptionclassScript to do a comparison of a list of algorithms using a list of statistics and a list of parameters and their values. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm
Subinterfaces of TetradSerializable in edu.cmu.tetrad.algcomparison.algorithmModifier and TypeInterfaceDescriptioninterfaceInterface that algorithm must implement.interfaceImplements an algorithm that takes multiple data sets as input.Classes in edu.cmu.tetrad.algcomparison.algorithm that implement TetradSerializableModifier 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.classA list of algorithm to be compared.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. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
Classes in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that implement TetradSerializableModifier 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 TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm.multi
Classes in edu.cmu.tetrad.algcomparison.algorithm.multi that implement TetradSerializableModifier 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. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that implement TetradSerializableModifier 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 TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
Classes in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that implement TetradSerializableModifier 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 TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm.other
Classes in edu.cmu.tetrad.algcomparison.algorithm.other that implement TetradSerializableModifier 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 TetradSerializable in edu.cmu.tetrad.algcomparison.algorithm.pairwise
Classes in edu.cmu.tetrad.algcomparison.algorithm.pairwise that implement TetradSerializable -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.graph
Subinterfaces of TetradSerializable in edu.cmu.tetrad.algcomparison.graphModifier and TypeInterfaceDescriptioninterfaceAn interface to represent a random graph of some sort.Classes in edu.cmu.tetrad.algcomparison.graph that implement TetradSerializableModifier and TypeClassDescriptionclassReturns a cyclic graph build up from small cyclic graph components.classCreates a random graph by the Erdos-Renyi method (probabiliy of edge fixed, # edges not).classCreates a random graph by adding forward edges.classCreates a random graph by adding forward edges.classCreates a random graph by adding forward edges.classCreates a random graph by adding forward edges.classCreates a random graph by adding forward edges.classReturns a scale free graph.classStores a single graph for use in simulations, etc. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.independence
Subinterfaces of TetradSerializable in edu.cmu.tetrad.algcomparison.independenceModifier and TypeInterfaceDescriptioninterfaceAn interface that extends functionality of theIndependenceWrapperandHasParametersinterfaces by adding support for block-specific configuration in independence testing.interfaceInterface that algorithm must implement.Classes in edu.cmu.tetrad.algcomparison.independence that implement TetradSerializableModifier and TypeClassDescriptionclassWrapper for BE-GCM (Basis-Expanded Generalised Covariance Measure Test).classWrapper for BF-Blocks-Test.classWrapper for BF-LRT (Basis Function Likelihood Ratio Test).classDeprecated.classDeprecated.classWrapper for BF-Blocks-Test.classWrapper for Daudin Conditional Independence test.classWrapper for Fisher Z test.classAnIndependenceWrapperthat runs the Fisher Z conditional independence test implemented in the Python causal-learn library, bridging it into Tetrad'sIndependenceTestframework.classAnIndependenceWrapperthat runs the Kernel-based Conditional Independence (KCI) test implemented in the Python causal-learn library, bridging it into Tetrad'sIndependenceTestframework.classAnIndependenceWrapperthat runs the Randomized Conditional Independence Test (RCIT) implemented in the Python causal-learn library, bridging it into Tetrad'sIndependenceTestframework.classWrapper for Fisher Z test.classWrapper for the CORD conditional independence test backed by Eric's engine (IndTestCordEric): an omnibus, orthogonal rank-score test of Y ⊥ Z | X that is sensitive to higher-moment, tail, and co-volatility dependence which a covariance-based test (e.g., Fisher Z) cannot see.classWrapper for DG LRT.classThe SemBicTest class implements the IndependenceWrapper interface and represents a test for independence based on SEM BIC algorithm.classWrapper for the equivalence (TOST) test on the Fisher Z partial correlation.classWrapper for FFCI test with a reduced parameter set.classWrapper for FF-CI-Continuous test.classWrapper for Fisher Z test.classWrapper for KCI test.classWrapper for GIN (Generalized Independent Noise) residual-independence test.classWrapper for Fisher Z test.classWrapper for KCI test.classWrapper for Minimax binning test.classWrapper for M-separation test.classWrapper for Fisher Z test.classDeprecated.classThe SemBicTest class implements the IndependenceWrapper interface and represents a test for independence based on SEM BIC algorithm.classDec 17, 2018 3:44:46 PMclassDeprecated.classRank Independence Test TS, the former name of the test now called Rank Independence Test TS Singletons.classDeprecated.classDeprecated.classWrapper for RCIT test.classThe SemBicTest class implements the IndependenceWrapper interface and represents a test for independence based on SEM BIC algorithm.classWrapper for the stratified (domain-pooled) rank conditional independence test, IndTestStratifiedRank -- the Phase 1 test of LCD-NOD (Dong, Dai, Ng, Spirtes, and Zhang, ICML 2026).classWrapper for Rank independence test.final classWrapper for the TRFF likelihood-ratio CI test built onTRffBicScore. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.score
Subinterfaces of TetradSerializable in edu.cmu.tetrad.algcomparison.scoreModifier and TypeInterfaceDescriptioninterfaceRepresents an interface for scoring data models using predefined block structures.interfaceInterface that algorithm must implement.Classes in edu.cmu.tetrad.algcomparison.score that implement TetradSerializableModifier and TypeClassDescriptionclassWrapper for BF-BGe, the BGe (Normal-Wishart marginal likelihood) score over the basis-function embedding that BF-BIC uses.classWrapper for Basis Function BIC Score (Basis-BIC) version.classWrapper for the full-sample (tabular) Basis Function BIC Score, delegating toBasisFunctionBicScoreFullSample.classWrapper for Fisher Z test.classWrapper for Blocks BIC Score (Blocks-BIC) version.classWrapper for the BGe (Bayesian Gaussian equivalent) score, the Gaussian analog of BDeu: the local score is the exact log marginal likelihood of a family under a Normal-Wishart prior rather than a BIC-penalized maximum likelihood.classWrapper for Blocks BIC Score (Blocks-BIC) version.classWrapper for Fisher Z test.classWrapper for DG-BGe, the BGe (Normal-Wishart marginal likelihood) score over the degenerate Gaussian indicator embedding that DG-BIC uses.classWrapper for degenerate Gaussian BIC scoreclassWrapper for Discrete BIC test.classWrapper for linear, Gaussian Extended BIC score (Chen and Chen).classWrapper for FF-ML MIxed Marginal Likelihood Score.classWrapper for FF Marginal Likelihood Score.classThe GicScores class is an implementation of the ScoreWrapper interface that calculates the Generalized Information Criterion (GIC) scores for a given data model.classWrapper for linear, Gaussian SEM BIC score.class// * Wrapper for Huang Marginal Likelihood Score.final classWrapper for InstanceAugmentedSemBicScore that: - pulls the testing DataSet from Params.TESTING_DATA (injected by the algorithm wrapper), - takes the instance row from Params.INSTANCE_ROW, - aligns columns by training variable names, - uses alpha from Params.IS_ALPHA (default 1.0).final classWrapper for ISBDeuScore (discrete).classWrapper for KVC BIC score.classWrapper for Kernel Marginal Likelihood Score.classWrapper for degenerate Gaussian BIC scoreclassWrapper for Fisher Z test.classDeprecated.classWrapper for the Poisson prior score (Bryan)classWrapper for linear, Gaussian SEM BIC score.classWrapper for linear, Gaussian SEM BIC score.classWrapper for linear, Gaussian SEM BIC score.classTheTRffBicScoreclass is a scoring mechanism designed to evaluate the fit and complexity of a data model.classWrapper for linear, Gaussian Extended BIC score (Chen and Chen). -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.simulation
Subinterfaces of TetradSerializable in edu.cmu.tetrad.algcomparison.simulationModifier and TypeInterfaceDescriptioninterfaceThe interface that simulations must implement.Classes in edu.cmu.tetrad.algcomparison.simulation that implement TetradSerializableModifier and TypeClassDescriptionclassThis class represents a Causal Perceptron Network.classBayes net simulation.classA simulation method based on the conditional Gaussian assumption.classImplements the DAG-adaptation of the Onion (DaO) simulation method for generating linear data from a DAG, with exogenous errors drawn from one of the reference implementation's five variance-matched families (Gaussian by default; Exponential, Gumbel, Laplace, or Uniform viadaoErrorDistribution), as described in:classSimulates data with the anatomy of a designed physical experiment (the archetype is the NASA Airfoil Self-Noise dataset), in contrast to an observational sample.classWrapper for the neural-net Generalized Additive Model (GAM) simulator.classThis class represents a Causal Perceptron Network.classThe GeneralSemSimulation class represents a simulation using a generalized structural equation model (SEM).classThis was used for a simulation to test the FTFC and FOFC algorithm and contains some carefully selected functions to test nonlinearity and non-Gaussianity.classNL SEM simulation.classThis class represents a Simulation using Structural Equation Modeling (SEM).classA version of the Lee and Hastic simulation.classThis class represents a continuous MNAR simulation.classLinear Fisher Model.classA simulation method based on the mixed variable polynomial assumption.classA linear SEM simulation whose exogenous noises are drawn independently from the distribution given by the customNoiseExpression parameter (default Exp(1)) rather than from Gaussians.classThis class represents a nonlinear functions of linear simulation.classSimulates data with the anatomy of a real observational scientific dataset (the archetype is the Algerian Forest Fires dataset, but with all complications defaulted off this is a plain mixed-data cross-sectional study).classThis class represents a post-nonlinear SEM model.classThis class represents a Simulation using Structural Equation Modeling (SEM).classSEM the discretize.classA list of simulations to be compared.classASimulationimplementation that returns a single supplied data set.classStandardized SEM simulation.classTime series SEM simulation.classTrained DAG model. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.statistic
Classes in edu.cmu.tetrad.algcomparison.statistic that implement TetradSerializableModifier and TypeClassDescriptionclassA list of statistics and their utility weights. -
Uses of TetradSerializable in edu.cmu.tetrad.algcomparison.utils
Subinterfaces of TetradSerializable in edu.cmu.tetrad.algcomparison.utilsModifier and TypeInterfaceDescriptioninterfaceA score wrapper that can construct its per-data-set scores jointly, coordinating any data-dependent representation choices across the data sets.Classes in edu.cmu.tetrad.algcomparison.utils that implement TetradSerializableModifier and TypeClassDescriptionfinal classThe test-side counterpart ofPooledScoreWrapper: builds the inner test on each pooled data set and combines them withIndTestMultiusing Fisher's method (default) or Tippett's method on the per-data-set p-values, perParams.POOLED_TEST_METHOD(data sets are assumed independent of one another, e.g.final classA score wrapper that pools several data sets into one IMaGES score built from an inner score wrapper. -
Uses of TetradSerializable in edu.cmu.tetrad.bayes
Subinterfaces of TetradSerializable in edu.cmu.tetrad.bayesModifier and TypeInterfaceDescriptioninterfaceInterface implemented by Bayes instantiated models.interfaceInterface for a discrete Bayes updating algorithm.interfaceAn interface representing a map of probabilities or counts for nodes in a Bayesian network.interfaceInterface for a Bayes updating algorithm that's capable of doing manipulation.Classes in edu.cmu.tetrad.bayes that implement TetradSerializableModifier and TypeClassDescriptionfinal classCalculates updated marginals for a Bayes net by simulating data and calculating likelihood ratios.final classCalculates cell probabilities from conditional BayesIm probabilities on the fly without constructing the entire table.final classImplements a discrete Bayes parametric model--that is, a DAG together with a map from the nodes in the graph to a set of discrete variables, specifying the number of categories for each variable and the name of each category for each variable.classRepresents a conditional probability table (CPT) in a Bayes net.classRepresents a conditional probability table (CPT) in a Bayes net.final classStores Dirichlet pseudocounts for the distributions of each variable conditional on particular combinations of its parent values and, together with Bayes Pm and Dag, provides methods to manipulate these tables.final classStores information for a variable source about evidence we have for each variable as well as whether each variable has been manipulated.final classIdentifiability, based on RowSummingExactUpdaterfinal classRowSummingExactUpdater-style updater plumbing, but uses JunctionTreeInference for marginals/joints/conditionals.final classStores information for a variable source about evidence we have for each variable as well as whether each variable has been manipulated.final classStores a table of probabilities for a Bayes net and, together with BayesPm and Dag, provides methods to manipulate this table.final classStores a table of probabilities for a Bayes net and, together with BayesPm and Dag, provides methods to manipulate this table.final classRepresents propositions over the variables of a particular BayesIm describing an event of a fairly general sort--namely, conjunctions of propositions that particular variables take on values from a particular disjunctive list of categories.final classPerforms updating operations on a BayesIm by summing over cells in the joint probability table for the BayesIm.final classCreates a table of stored cell probabilities for the given list of variables.final class///////////////////////////////////////////////////////////////////final classRepresents a Bayes IM in which all of the conditional probability tables have been updated to take into account evidence.final classRowSummingExactUpdater-style updater plumbing, but uses VariableEliminationInference for marginals/joints/conditionals. -
Uses of TetradSerializable in edu.cmu.tetrad.calculator.expression
Subinterfaces of TetradSerializable in edu.cmu.tetrad.calculator.expressionModifier and TypeInterfaceDescriptioninterfaceRepresents a mathematical expression.interfaceRepresents a definition for some expression.interfaceRepresents the signature of the expression, for example sqrt(number).Classes in edu.cmu.tetrad.calculator.expression that implement TetradSerializableModifier and TypeClassDescriptionclassRepresents a constant expression, that is an expression that always evaluates to the same value.classAn equation expression.static enumAn enum of positions that an expression can occur in.classAn Expression for a variable. -
Uses of TetradSerializable in edu.cmu.tetrad.classify
Classes in edu.cmu.tetrad.classify that implement TetradSerializableModifier and TypeClassDescriptionfinal classThis class contains a method classify which uses an instantiated Bayes net (BayesIm) provided in the constructor. -
Uses of TetradSerializable in edu.cmu.tetrad.data
Subinterfaces of TetradSerializable in edu.cmu.tetrad.dataModifier and TypeInterfaceDescriptioninterfaceStores a 2D array of data.interfaceInterface implemented by classes, instantiations of which can serve as data models in Tetrad.interfaceImplements a rectangular data set, in the sense of being a dataset with a fixed number of columns and a fixed number of rows, the length of each column being constant.interfaceInterface for covariance matrices.interfaceInterface implemented by classes that are capable of participating in the transfer of knowledge objects.interfaceCreated by jdramsey on 12/22/15.interfaceInterface implemented by classes, instantiations of which are capable of serving as variables for columns in a DataSet.interfaceInteface implemented by classes, instantiations of which are associated with lists of variables.Classes in edu.cmu.tetrad.data that implement TetradSerializableModifier and TypeClassDescriptionclassBase class for variable specifications for DataSet.final classWraps a DataBox in such a way that mixed data sets can be stored.classStores a 2D array of byte data.final classSpecifies how a column (continuous or discrete) should be discretized.final classRepresents a real-valued variable.final classStores a correlation matrix together with variable names and sample size; intended as a representation of a data set.classStores a covariance matrix together with variable names and sample size, intended as a representation of a data set.classStores a covariance matrix together with variable names and sample size, intended as a representation of a data set.classStores a covariance matrix together with variable names and sample size, intended as a representation of a data set.final classStores a list of data models and keeps track of which one is selected.final classType-safe enum of delimiter types for parsing data.final classSpecifies how a column (continuous or discrete) should be discretized.final classRepresents a discrete variable as a range of integer-valued categories 0, 1, ..., m - 1, where m is the number of categories for the variable.final classType-safe enum of discrete variable types.classStores a 2D array of double data.classStores a 2D array of float data.classStores a list of independence facts.classStores a 2D array of integer data.final classStores information about required and forbidden edges and common causes for use in algorithm.final classImplements a knowledge edge X-->Y as a simple ordered pair of strings.final classRepresents a "Other Group" in Knowledge, which can be understood as: Group1 -> Group2 where there are edges between all members of Group1 to Group2.final classAn additional, named tier structure over (a subset of) the variables of aKnowledgeobject, independent of the main temporal tiers and of every other tier structure.classStores a 2D array of long data.classStores a 2D array of double continuousData.final classWraps a 2D array of Number objects in such a way that mixed data sets can be stored.classStores a 2D array of short data.final classSpecifies how a column (continuous or discrete) should be discretized.final classStores time series data as a list of continuous columns.classStores a 2D array of double data.classStores a 2D array of int data. -
Uses of TetradSerializable in edu.cmu.tetrad.data.missing
Classes in edu.cmu.tetrad.data.missing that implement TetradSerializableModifier and TypeClassDescriptionfinal classAn immutable specification of how missing data are to be handled: aMissingDataPolicytogether with the parameters that policy needs (EM settings forMissingDataPolicy.EM_COVARIANCE, the number of imputations forMissingDataPolicy.MULTIPLE_IMPUTATION, and so on). -
Uses of TetradSerializable in edu.cmu.tetrad.data.simulation
Classes in edu.cmu.tetrad.data.simulation that implement TetradSerializableModifier and TypeClassDescriptionclassLoad data sets and graphs from a directory.classLoad data sets and graphs from a directory.classLoad data sets and graphs from a directory.classLoad data sets and graphs from a directory.classLoad data sets and graphs from a directory. -
Uses of TetradSerializable in edu.cmu.tetrad.estimate.v1
Classes in edu.cmu.tetrad.estimate.v1 that implement TetradSerializableModifier and TypeClassDescriptionstatic final classv1: Configuration knobs with conservative defaults.static final classv1: Result object returned to UI/table. -
Uses of TetradSerializable in edu.cmu.tetrad.graph
Subinterfaces of TetradSerializable in edu.cmu.tetrad.graphModifier and TypeInterfaceDescriptioninterfaceImplements a graph capable of storing edges of type N1 *-# N2 where * and # are endpoints of type Endpoint.interfaceRepresents an object with a name, node type, and position that can serve as a node in a graph.Classes in edu.cmu.tetrad.graph that implement TetradSerializableModifier and TypeClassDescriptionfinal classRepresents a directed acyclic graph--that is, a graph containing only directed edges, with no cycles.classRepresents an edge node1 *-# node2 where * and # are endpoints of type Endpoint--that is, Endpoint.TAIL, Endpoint.ARROW, or Endpoint.CIRCLE.classStores a graph a list of lists of edges adjacent to each node in the graph, with an additional list storing all of the edges in the graph.classApr 13, 2017 3:56:46 PMenumA enumeration of the endpoint types that are permitted in Tetrad-style graphs: null (-), arrow (->), circle (-o), start (-*), and null (no endpoint).classImplements a basic node in a graph--that is, a node that is not itself a variable.final classStores a triple (x, y, z) of nodes.classImplements a graph allowing nodes in the getModel time lag to have parents taken from previous time lags.final classSVAR-style lag mirroring policy.classOrderedPair<E>An ordered pair of objects.classPaths class.classEdgeListGraph subclass that applies anEdgeReplicationPolicywhenever edges are added/removed or endpoints are oriented.final classRepresents the graphical structure of a structural equation model.classRepresents a time series graph--that is, a graph with a fixed number S of lags, with edges into initial lags only--that is, into nodes in the first R lags, for some R.final classStores a triple (x, y, z) of nodes.classUnderlines class. -
Uses of TetradSerializable in edu.cmu.tetrad.hybridcg
Classes in edu.cmu.tetrad.hybridcg that implement TetradSerializableModifier and TypeClassDescriptionfinal classResult ofHybridCgEdgeSignificance.backwardPrune(HybridCgModel.HybridCgPm, DataSet, double, boolean): a per-child backward elimination of edges whose per-edge likelihood-ratio test could not distinguish the reduced local model from the full one at the given level.static final classOne proposed edge deletion. -
Uses of TetradSerializable in edu.cmu.tetrad.regression
Classes in edu.cmu.tetrad.regression that implement TetradSerializableModifier and TypeClassDescriptionclassImplements a logistic regression algorithm based on a Javascript implementation by John Pezzullo.static classThe result of a logistic regression.classStores the various components of a regression result so they can be passed around together more easily. -
Uses of TetradSerializable in edu.cmu.tetrad.search
Subinterfaces of TetradSerializable in edu.cmu.tetrad.searchModifier and TypeInterfaceDescriptioninterfaceThe ModelObserver interface is implemented by classes that want to observe changes in a model.Classes in edu.cmu.tetrad.search that implement TetradSerializableModifier and TypeClassDescriptionstatic classRepresents a single record in the returned table for CSTaR.static final classRepresents the result of a near-total aggregate decomposition (NTAD) analysis. -
Uses of TetradSerializable in edu.cmu.tetrad.search.blocks
Classes in edu.cmu.tetrad.search.blocks that implement TetradSerializableModifier and TypeClassDescriptionfinal classRepresents a block specification that organizes data into blocks, each associated with a variable and a rank. -
Uses of TetradSerializable in edu.cmu.tetrad.search.score
Classes in edu.cmu.tetrad.search.score that implement TetradSerializable -
Uses of TetradSerializable in edu.cmu.tetrad.search.test
Classes in edu.cmu.tetrad.search.test that implement TetradSerializableModifier and TypeClassDescriptionfinal classShared cache + utilities for independence testing keyed by (X,Y|Z) using variable NAMES for mapping into the test, but using a structured int-ID cache key for speed/GC reduction.static final recordThis record represents an evaluation with a binary indicator of independence and an associated p-value.final classStores a single conditional independence result, e.g., whether X _||_ Y | Z1,...,Zn holds or does not, and the p-value of the test. -
Uses of TetradSerializable in edu.cmu.tetrad.search.utils
Classes in edu.cmu.tetrad.search.utils that implement TetradSerializableModifier and TypeClassDescriptionclassA class for heuristically removing almost cycles from a PAG to avoid unfaithfulness in an estimated PAG.enumEnumerates the algorithm types for BuildPureClusters, and Purify.enumEnumerates the test types for BuildPureClusters, and Purify.final classStores a map from pairs of nodes to separating sets--that is, for each unordered pair of nodes {node1, node2} in a graph, stores a set of nodes conditional on which node1 and node2 are independent (where the nodes are considered as variables) or stores null if the pair was not judged to be independent.classRepresents an ordered sextad of nodes.classRepresents an ordered sextad of nodes.final recordRepresents an ordered tetrad (quartet) of nodes, where the order of nodes within {i, j} and {k, l} does not matter, but the order of the pairs <{i, j}, {k, l}> does matter. -
Uses of TetradSerializable in edu.cmu.tetrad.search.work_in_progress
Classes in edu.cmu.tetrad.search.work_in_progress that implement TetradSerializable -
Uses of TetradSerializable in edu.cmu.tetrad.sem
Subinterfaces of TetradSerializable in edu.cmu.tetrad.semModifier and TypeInterfaceDescriptioninterfaceAn interface for SemIM's; see implementations.interfaceInterface for algorithm that optimize the fitting function of a SemIm model by adjusting its freeParameters in search of a global maximum.Classes in edu.cmu.tetrad.sem that implement TetradSerializableModifier and TypeClassDescriptionfinal classRepresents a report evaluating the adequacy of a model's performance relative to a baseline.final classResult of k-fold cross-validation performed by NNEstimator#crossValidate(int).final classEstimates a SemIm given a CovarianceMatrix and a SemPm.final classResult of a single edge-strength computation performed byNNEstimator.computeEdgeStrength(String, String, int).classRepresents a generalized SEM-instantiated model.final classParametric model for a Generalized SEM model.classMaps a parameter to the matrix element where its value is stored in the model.final classPure-library neural-network estimator for a DAG factorization.final classTuning parameters forNNEstimator.final classRepresents the adequacy summary of a specific node in a model with information about its characteristics, performance metrics, and improvement over a baseline.final classImmutable per-node summary produced by k-fold cross-validation in NNEstimator#crossValidate(int).classA class for implementing constraints on the values of the freeParameters of of instances of the SemIm class.final classStores information about the identity of a SEM parameter--its name, its type (COEF, COVAR), and the node(s) it is associated with.classImplements an ordered pair of objects (a, b) suitable for storing in HashSets.final classResult of a partial edge strength computation performed byNNEstimator.computePartialEdgeStrength(String, String, int).final classResult ofNNEstimator.pruneByPredictiveContribution(int, double): a per-child backward elimination of parents whose held-out predictive contribution is not distinguishable from zero.static final classOne proposed edge deletion.final classEstimates a SemIm given a CovarianceMatrix and a SemPm.final classStores the freeParameters for an instance of a SemEstimatorGibbs.final classStores information for a SemIm about evidence we have for each variable as well as whether each variable has been manipulated.final classStores an instantiated structural equation model (SEM), with error covariance terms, possibly cyclic, suitable for estimation and simulation.final classStores information for a BayesIm about evidence we have for each variable as well as whether each variable has been manipulated.classOptimizes a DAG SEM with hidden variables using expectation-maximization.classOptimizes a SEM using Powell's method from the Apache library.classOptimizes a DAG SEM by regressing each varaible onto its parents using a linear regression.classOptimizes a SEM using RICF for ADMGs (no selection bias).classOptimizes a SEM by randomly selecting points in cubes of decreasing size about a given point.final classParametric model for Structural Equation Models.final classRepresents propositions over the variables of a particular BayesIm describing and event of a fairly general sort--namely, conjunctions of propositions that particular variables take on values from a particular disjunctive list of categories.classCalculates updated structural equation models given evidence of the form X1=x1',...,The main task of such and algorithm is to calculate P(X = x' | evidence), where evidence takes the form of a Proposition over the variables in the Bayes net, possibly with additional information about which variables in the Bayes net have been manipulated.classA special SEM model in which variances of variables are always 1 and means of variables are always 0.static final classStores a coefficient range--i.e.final classTrained DAG simulator (GNM): learn local mechanisms with non-additive noise and resimulatestatic final classRepresents a report for a single node in a trained directed acyclic graph (DAG) structure.static final classRepresents a configuration class containing various hyperparameters and settings used for the simulation and training of a directed acyclic graph (DAG) model.static final classRepresents the result of a simulation, containing continuous and discrete data for variables, metadata about the simulation, and support for generating reports. -
Uses of TetradSerializable in edu.cmu.tetrad.study.gene.tetrad.gene.graph
Classes in edu.cmu.tetrad.study.gene.tetrad.gene.graph that implement TetradSerializableModifier and TypeClassDescriptionclassAdds Javabean property change events so that it can be used in a MVC type architecture.final classConstructs as a (manual) update graph.classStores the parameters needed to generate a new lag graph, whether randomized or manually constructed.classStores a file for reading in a lag graph from a file. -
Uses of TetradSerializable in edu.cmu.tetrad.study.gene.tetrad.gene.history
Subinterfaces of TetradSerializable in edu.cmu.tetrad.study.gene.tetrad.gene.historyModifier and TypeInterfaceDescriptioninterfaceInstantiations of this interface know how to randomize update graphs in particular ways.interfaceInitializes a history array.interfaceLag graph.interfaceA distribution from which noise values are drawn.interfaceImplements a function from the previous time steps of a history array to the getModel time step.Classes in edu.cmu.tetrad.study.gene.tetrad.gene.history that implement TetradSerializableModifier and TypeClassDescriptionclassInitializes a history array by setting the value of each variable to basal if it is unregulated (has no parents other than itself one time step back) and to a random value chosen from a N(basal, initStDev) distribution otherwise.final classStores a time series in the "update" (rather than, say, the "repeated") form--that is, for a given set of factors (the word "factor" is being used here to avoid ambiguity), only lags behind the getModel time step are recorded temporally, with causal edges extending from lagged factors with lags >= 1 to factors in the getModel time step (lag = 0) only.classStores a boolean function from a set of boolean-valued parents to a single boolean-valued column.classUpdates a gene given a history using the formula Gi.0 = max(Gi.1 - decayRate * -Gi.1 + booleanInfluenceRate * F(Parents(Gi) in the graph \ Gi.1), lowerBound), as described in Edwards and Glass, (2000), "Combinatorial explosion in model gene networks", American Institute of Physics.classModels the manner in which gene models are initialized differentially depending on the dishes that the cells are in.classImplements the basic machinery used by all history objects.classStores a "shapshot" of the indexedConnectivity of a lag graph, using indices rather than Strings to refer to factors.classStores a "shapshot" of the indexedLagGraph of a lag graph, using indices rather than Strings to refer to factors.final classHolds an ordered pair (index, lag) to represent a causal parent of a factor, where the factor at the given index is independently known.classwrapper class for passing factor+edge via a propertyChange eventclassIdentifies a particular factor (by name) at a particular lag (integer).classImplements a linear update function, Gi.0 = L(Parents(G0.0)) + ei, where P is a polynomial function and ei is a random noise term.final classImplements a polynomial as a sum of a list of terms whose variables are identified as integers in the set {0, 1, 2, ...}.classImplements a polynomial update function, Gi.0 = P(Parents(G0.0)) + ei, where P is a polynomial function and ei is a random noise term.classImplements a term in a polymonial whose variables are mapped to indices in in the set {0, 1, 2, ...}. -
Uses of TetradSerializable in edu.cmu.tetrad.study.gene.tetrad.gene.simulation
Classes in edu.cmu.tetrad.study.gene.tetrad.gene.simulation that implement TetradSerializableModifier and TypeClassDescriptionclassSimulates measurement genetic data using an underlying GeneHistory object to generate individual cell data. -
Uses of TetradSerializable in edu.cmu.tetrad.study.gene.tetradapp.model
Classes in edu.cmu.tetrad.study.gene.tetradapp.model that implement TetradSerializableModifier and TypeClassDescriptionclassImplements a parametric gene model.classWraps MeasurementSimulator so that it may be used as a parameter object. -
Uses of TetradSerializable in edu.cmu.tetrad.util
Subinterfaces of TetradSerializable in edu.cmu.tetrad.utilModifier and TypeInterfaceDescriptioninterfaceTagging interface for instantiated models.interfaceRepresents the configuration for the logger.static interfaceRepresents an event which is just an id and a description.Classes in edu.cmu.tetrad.util that implement TetradSerializableModifier and TypeClassDescriptionclassLogger configuration.static classA default implementation of the event.classWraps the EJML linear algebra library for most uses in Tetrad.classAllows a view of a matrix to be created that is a subset of the original matrix, to allow parts of a matrix to be set using indices in the view.classStores a list of named parameters with their values.classFrequency function of partial correlation r(12|34...k), assuming that the true partial correlation is equal to zero.classStores a (x, y) point without having to use awt classes.static classRepresents an empty configuration for the logger.classVector wrapping matrix library.classRepresents the getModel Tetrad version. -
Uses of TetradSerializable in edu.cmu.tetrad.util.dist
Subinterfaces of TetradSerializable in edu.cmu.tetrad.util.distModifier and TypeInterfaceDescriptioninterfaceInterface for a statistical distribution from which random values can be drawn.Classes in edu.cmu.tetrad.util.dist that implement TetradSerializableModifier and TypeClassDescriptionclassImplements a Beta distribution for purposes of drawing random numbers.classWraps a chi square distribution for purposes of drawing random samples.classWraps a chi square distribution for purposes of drawing random samples.classWraps a chi square distribution for purposes of drawing random samples.classWraps a chi square distribution for purposes of drawing random samples.classGaussianPower class.classCreated by IntelliJ IDEA.classRepresents a lognormal distribution for purposes of sampling.classWraps a chi square distribution for purposes of drawing random samples.classA normal distribution that allows its parameters to be set and allows random sampling.classWraps a chi square distribution for purposes of drawing random samples.classA pretend distribution that always returns the given value when nextRandom() is called.classWraps a chi square distribution for purposes of drawing random samples.classA normal distribution that allows its parameters to be set and allows random sampling.classFor given a, b (a < b), returns a point chosen uniformly from [a, b].