Uses of Package
edu.cmu.tetrad.search.utils
Packages that use edu.cmu.tetrad.search.utils
Package
Description
This package contains classes for causal graph search algorithms.
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.
-
Classes in edu.cmu.tetrad.search.utils used by edu.cmu.tetrad.graphClassDescriptionPerforms the final orientation steps of the FCI algorithms, which is a useful tool to use in a variety of FCI-like algorithms.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.utils used by edu.cmu.tetrad.searchClassDescriptionInterface for a method that scores a DAG.Performs the final orientation steps of the FCI algorithms, which is a useful tool to use in a variety of FCI-like algorithms.GrowShrinkTree class.Stores a matrix together with a row and column permutation.A helper class to encapsulate logic for preserving a Markov property for subsequent testing after an initial local Markov graph has been found.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.utils used by edu.cmu.tetrad.search.testClassDescriptionGives the method to be used to resolve sepsets when they conflict.
-
Classes in edu.cmu.tetrad.search.utils used by edu.cmu.tetrad.search.utilsClassDescriptionAn arrow in the search.Enumerates the algorithm types for BuildPureClusters, and Purify.Enumerates the test types for BuildPureClusters, and Purify.Gives the options for checking significance of clusters--could check the significance using a regression model, or could check to see if the cluster is a clique, or could not do the check.Interface for a method that scores a DAG.Implements a test for simultaneously zero sextads in the style of Bollen, K.Implements a test for simultaneously zero sextads in the style of Bollen, K.Represents a discriminating path in a graph.Represents the embedded data result, holding the original dataset, the transformed embedded dataset, and a mapping between the indices of original variables and their corresponding transformed variables.Stores a result for checking whether a graph is a legal MAG--(a) whether it is (a boolean), and (b) the reason why it is not, if it is not (a String).Stores a result for checking whether a graph is a legal PAG--(a) whether it is (a boolean), and (b) the reason why it is not, if it is not (a String).Represents a graphoid independence fact--i.e., a fact in a general independence model (IM) X _||_Y | Z.Gives the options for triple type for a conservative unshielded collider orientation, which may be "collider" or "noncollider" or "ambiguous".Provides an interface for Purify algorithm.Gives an implemented that is implemented by classes that evaluate scalar valued kernelsDetermines 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.Finds possible d-connecting undirectedPaths for the IonSearch.A helper class to encapsulate logic for preserving a Markov property for subsequent testing after an initial local Markov graph has been found.The FCI orientation rules are almost entirely taken up with an examination of the FCI graph, but there are two rules that require looking at the distribution.The FciOrientDataExaminationStrategyTestBased class implements the FciOrientDataExaminationStrategy interface and provides methods for checking unshielded colliders and determining orientations based on the Discriminating Path Rule.Enum representing the different types of blocking strategies.Represents a node in Dijkstra's algorithm.Represents a graph for Dijkstra's algorithm.The rule that is being implemented, R5 or R9.Gives the method to be used to resolve sepsets when they conflict.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.Provides a covenience interface for classes that can generate and keep track of sepsets.The SetEndpointStrategy interface provides a strategy for setting the endpoint of an edge in a graph.Represents an ordered sextad of nodes.Represents an ordered sextad of nodes.Represents 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.Provides an interface for classes that test tetrad constraints.Gives a result consisting of the residuals and collapsed var graphs.
-
Classes in edu.cmu.tetrad.search.utils used by edu.cmu.tetrad.search.work_in_progressClassDescriptionEnumerates the test types for BuildPureClusters, and Purify.Gives the method to be used to resolve sepsets when they conflict.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.Implements and extends a scorer extending Teyssier, M., and Koller, D.