Uses of Package
edu.cmu.tetrad.search
Packages that use edu.cmu.tetrad.search
Package
Description
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.algcomparison.algorithm.multi
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.algcomparison.independenceClassDescriptionInterface implemented by classes that do conditional independence testing.
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.algcomparison.score
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.graphClassDescriptionInterface implemented by classes that do conditional independence testing.Stores 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.
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.searchClassDescriptionConstructs and AD leaf tree on the fly.This class contains a method classify which uses an instantiated Bayes net (BayesIm) provided in the constructor.An enumeration of the test types for BuildPureClusters, and Purify.Calculates marginal chi square test results for a discrete dataset.Simple class to store the parameters of the result returned by the G Square test.A return value for a likelihood--returns a likelihood value and the degrees of freedom for it.A return value for a likelihood--returns a likelihood value and the degrees of freedom for it.Implements a test for simultaneously zero sextads in the style of Bollen, K.Implements a test for simultaneously zero tetrads in Bollen, K.Interface implemented by classes that do discrete classification.A return value for a likelihood--returns a likelihood value and the degrees of freedom for it.A list containing the following componentsReturn value of the algorithm.**************************************************************************************Interface for a method that scores a DAG.Interface for a search method that returns a graph.Dag plus edge weights.Simple class to store the parameters of the result returned by the G Square test.Loss function for PC: * for adjacency errors, 1 pt (i.e.Interface for Bff (Best Fit Finder) algorithm.Created by jdramsey on 2/21/16.A list of nodes and corresponding minimum effects.An interface for fast adjacency searches (i.e.Adds any orientations implied by the given orientation.Interface implemented by classes that do conditional independence testing.Interface implemented by classes that do conditional independence testing.A typesafe enumeration of the types of independence tests that are used for basic search algorithm in this package.An interface for Purify algorithm.Created by jdramsey on 2/21/16.Determines whether nodes indexed as (n1, center, n2) form a legal pair of edges in a graph for purposes of some algorithm that uses this information.This small class is used to store graph permutations.Created by IntelliJ IDEA.An interface for Markov blanket searches.Finds possible d-connecting undirectedPaths for the IonSearch.Reorients all or part of the given graph.Interface for a score suitable for FGESStores a graph with a score.Implements the continuous BIC score for FGES.Implements the continuous BIC score for FGES.Stores 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.This is the same as the usual SepsetMap described below, but also keeps up with the individual sets of conditioning nodes for d-separation relations for use with the Distributed Causal Inference (DCI) algorithm.Represents a sextad of variables.An enumeration of the test types for BuildPureClusters, and Purify.Represents a tetrad of variables.Interface implemented by classes that test tetrad constraints.Implements a scorer extending Teyssier, M., and Koller, D.Implements a scorer extending Teyssier, M., and Koller, D.Implements a scorer extending Teyssier, M., and Koller, D.
-
Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.search.mbClassDescriptionInterface for a search method that returns a graph.Interface implemented by classes that do conditional independence testing.An interface for Markov blanket searches.
-
Classes in edu.cmu.tetrad.search used by edu.pitt.csb.mgmClassDescriptionInterface for a search method that returns a graph.Interface implemented by classes that do conditional independence testing.
-
Classes in edu.cmu.tetrad.search used by edu.pitt.dbmi.algo.bayesian.constraint.searchClassDescriptionInterface for a search method that returns a graph.Extends Erin Korber's implementation of the Fast Causal Inference algorithm (found in FCI.java) with Jiji Zhang's Augmented FCI rules (found in sec.