Uses of Package
edu.cmu.tetrad.search.utils
Packages that use edu.cmu.tetrad.search.utils
Package
Description
Contains classes for searching for (mostly structural) causal models given data.
Contains classes for running conditional independence tests for various sorts of data.
Contains some utility classes for search algorithms.
Contains some classes that aren't ready for prime time.
-
Classes in edu.cmu.tetrad.search.utils used by edu.cmu.tetrad.graphClassDescriptionStores 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.
-
Classes in edu.cmu.tetrad.search.utils used by edu.cmu.tetrad.searchClassDescriptionEnumerates 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.Gives the type of conflict to be used, priority (when there is a conflict, keep the orientation that has already been made), bidirected (when there is a conflict, orient a bidirected edge), or overwrite (when there is a conflict, use the new orientation).NONE = no heuristic, PC-1 = sort nodes alphabetically; PC-1 = sort edges by p-value; PC-3 = additionally sort edges in reverse order using p-values of associated independence facts.Stores a matrix together with a row and column permutation.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.utilsClassDescriptionEnumerates 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 tetrads in Bollen, K.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".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).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.Give the options for the collider discovery algroithm to use--FAS with sepsets reasoning, FAS with conservative reasoning, or FAS with Max P reasoning.Gives the type of conflict to be used, priority (when there is a conflict, keep the orientation that has already been made), bidirected (when there is a conflict, orient a bidirected edge), or overwrite (when there is a conflict, use the new orientation).Gives the type of FAS used, regular or stable.NONE = no heuristic, PC-1 = sort nodes alphabetically; PC-1 = sort edges by p-value; PC-3 = additionally sort edges in reverse order using p-values of associated independence facts.Finds possible d-connecting undirectedPaths for the IonSearch.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.Represents an ordered sextad of nodes.Represents a ordered tetrad of variables, (i, j, k, l).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.NONE = no heuristic, PC-1 = sort nodes alphabetically; PC-1 = sort edges by p-value; PC-3 = additionally sort edges in reverse order using p-values of associated independence facts.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.