Uses of Package
edu.cmu.tetrad.data

Packages that use edu.cmu.tetrad.data
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.
 
 
 
 
 
 
 
 
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes whose purpose is to generate modifications of data sets.
    Implements 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.
    Represents a discrete variable as a range of integer-valued categories 0, 1, ..., m - 1, where m is the number of categories for the variable.
    Created by jdramsey on 12/22/15.
    Inteface implemented by classes, instantiations of which are associated with lists of variables.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
    Represents a discrete variable as a range of integer-valued categories 0, 1, ..., m - 1, where m is the number of categories for the variable.
  • Class
    Description
    Base class for variable specifications for DataSet.
    Wraps a DataBox in such a way that mixed data sets can be stored.
    Represents a cell table that stores the values of the cells in a table of arbitrary dimension, for use, e.g., in the context of a contingency table--e.g.
    Represents a real-valued variable.
    Stores a correlation matrix together with variable names and sample size; intended as a representation of a data set.
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Stores a 2D array of data.
    Interface implemented by classes whose purpose is to generate modifications of data sets.
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Stores a list of data models and keeps track of which one is selected.
    Implements 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.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
    Type-safe enum of delimiter types for parsing data.
    Specifies how a column (continuous or discrete) should be discretized.
    Represents a discrete variable as a range of integer-valued categories 0, 1, ..., m - 1, where m is the number of categories for the variable.
    Type-safe enum of discrete variable types.
    A continuous or discrete discretization spec (see).
    A discretization specification for a continuous variable.
    The result of an EM run: the estimated mean and covariance, together with convergence information.
    Interface for covariance matrices.
    Stores a list of independence facts.
    Joins two tabular data sets on a key, in the manner of a database join: each row of the left data set is looked up in the right data set by its key value(s), and the right data set's non-key columns are appended to it.
    Which unmatched rows to keep.
    The joined data set and a findings-only report.
    Stores information about required and forbidden edges and common causes for use in algorithm.
    Implements a knowledge edge X-->Y as a simple ordered pair of strings.
    Represents a "Other Group" in Knowledge, which can be understood as: Group1 -> Group2 where there are edges between all members of Group1 to Group2.
    An additional, named tier structure over (a subset of) the variables of a Knowledge object, independent of the main temporal tiers and of every other tier structure.
    Interface implemented by classes that are capable of participating in the transfer of knowledge objects.
    A logarithmic transform to apply to a single variable: the direction (log or unlog), the offset a, and the base.
    Reshapes a long-format data set (one row per unit per occasion, e.g., one row per student per assessment) into a wide-format data set (one row per unit, one column per occasion per measured variable).
    How multiple long rows for the same (unit, level) combination are combined into one wide cell.
    The wide data set, the unit keys in row order (one list of row-key values per wide row), and a findings-only report.
    One term in the deletion propensity of a target variable: the effect of a driver variable's standardized value, or of its missingness indicator, on the log odds that the target is deleted.
    The terms of the deletion mechanism beyond the per-variable level and the row effect.
    The mechanism class of an injection.
    What the mechanism was, and how monotone the realized pattern is.
    A report of what was actually injected, for checking that the realized pattern is the intended one.
    The injected data together with its reports.
    The injection specification.
    Wraps a 2D array of Number objects in such a way that mixed data sets can be stored.
    Specifies how a column (continuous or discrete) should be discretized.
    Stores time series data as a list of continuous columns.
    Minimal, UI-friendly spec for the unmixer.
    The ColliderStyle enum represents different styles for handling colliders during graph learning processes.
    The CovarianceMode enum represents different modes for handling covariance calculations during graph learning processes.
    The GraphLearner enum represents different algorithms or strategies used for graph learning processes within a system.
    The SupersetScore enum represents statistical ranking correlation coefficients that can be used to assess the relationship between two rankings.
    Interface implemented by classes, instantiations of which are capable of serving as variables for columns in a DataSet.
    Inteface implemented by classes, instantiations of which are associated with lists of variables.
  • Class
    Description
    Implements 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.
    Interface for covariance matrices.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Interface for covariance matrices.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    The type of the data set--continuous if all continuous variables, discrete if all discrete variables; otherwise, mixed.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
    Represents a discrete variable as a range of integer-valued categories 0, 1, ..., m - 1, where m is the number of categories for the variable.
    Interface for covariance matrices.
  • Class
    Description
    Stores a correlation matrix together with variable names and sample size; intended as a representation of a data set.
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Implements 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.
    Interface for covariance matrices.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Implements 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.
  • Class
    Description
    Implements 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.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Interface for covariance matrices.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Implements 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.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Implements 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.
    Interface for covariance matrices.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Interface for covariance matrices.
    Stores a list of independence facts.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Interface for covariance matrices.
    Stores a list of independence facts.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Stores a correlation matrix together with variable names and sample size; intended as a representation of a data set.
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Represents a discrete variable as a range of integer-valued categories 0, 1, ..., m - 1, where m is the number of categories for the variable.
    Interface for covariance matrices.
    Stores a list of independence facts.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Stores a correlation matrix together with variable names and sample size; intended as a representation of a data set.
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Interface for covariance matrices.
    Stores a list of independence facts.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Stores a covariance matrix together with variable names and sample size, intended as a representation of a data set.
    Implements 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.
    Interface for covariance matrices.
    Stores information about required and forbidden edges and common causes for use in algorithm.
    Created by jdramsey on 12/22/15.
  • Class
    Description
    Implements 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.
    Stores a 2D array of int data.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Interface implemented by classes, instantiations of which can serve as data models in Tetrad.
    Implements 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.
    Stores information about required and forbidden edges and common causes for use in algorithm.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
  • Class
    Description
    Implements 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.
    Stores information about required and forbidden edges and common causes for use in algorithm.