Package edu.cmu.tetrad.search.work_in_progress
package edu.cmu.tetrad.search.work_in_progress
Contains some classes that aren't ready for prime time. Please use these classes at your own risk, and don't expect
them to work 100%. They are provided for your convenience, but are not supported, though if you find a bug, please
report it.
-
ClassDescriptionImplements a really simple idea for building pure clusters, just using the Purify algorithm.Implements the DCI (Distributed Causal Inference) algorithm for learning causal structure over a set of variable from multiple datasets that each may only measure proper overlapping subsets of that sets, or datasets with some variables in common and others not.Uses expectation-maximization to sort a a data set with data sampled from two or more multivariate Gaussian distributions into its component data sets.Created by user on 2/27/18.Implements the DM search.Implements a modified version of the the "fast adjacency search" for use in the Distributed Causal Inference (DCI) algorithm.Implements the "fast adjacency search" used in several causal algorithm in this package.Runs IMaGES on a list of algorithms and then produces a graph over the ImaGES adjacencies where each edge orientation is voted on by running FASK on each dataset in turn and voting on edge orientation.Runs Fast Adjacency Search (FAS) and then orients each edge using the robust skew orientation algorithm.A translation from Tibshirani's 2008 Fortran implementation of glasso.Return value of the algorithm.Provides s a data structure created mainly for use in the ION search algorithm.Implements the GRASP algorithms, with various execution flags.Interface for Bff (Heuristic Best Significant Model Search) algorithm.Heuristic Best Significant Model Search using a beam search.A move.Types of moves the algorithm can make.The score.Heuristic Best Significant Model Search using the GES algorithm.A graph with a P value.The score of a model.Implements IAMB.Created by IntelliJ IDEA.Instance-specific GFci given in Fattaneh Jabbari's dissertation (Pages 144-147)Checks conditional independence for continuous variables using Cramer's T-test formula (Cramer, Mathematical Methods of Statistics (1951), page 413).Calculates independence from pooled residuals.Checks conditional independence of variable in a continuous data set using Fisher's Z test.Performs a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.Performs a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.Performs a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.Checks conditional independence of variable in a continuous data set using Fisher's Z test.Checks independence facts for variables associated with a sepset by simply querying the sepsetImplements the Inter-IAMB algorithm.Returns edges whose entries in the precision matrix exceed a certain threshold.Implements the ION (Integration of Overlapping Networks) algorithm for distributed causal inference.Provides a static method which implements a correct version of Reiter's hitting set algorithm as described by Greiner, Smith, and Wilkerson in "A Correction to the Algorithm in Reiter's Theory of Diagnosis" Artificial Intellegence 41 (1989) (see for detailed specification).Added by Fattaneh Calculates the Instance-Specific BDeu score.A class representing the ISBicScore, which calculates BIC scores for a Bayesian network considering different structural changes and their impacts using an information-sharing mechanism.GesSearch is an implementation of the GES algorithm, as specified in Chickering (2002) "Optimal structure identification with greedy search" Journal of Machine Learning Research.Interface for a score suitable for FGESKernelized PC algorithm.Gives a BIC score for a linear, Gaussian MAG (Mixed Ancestral Graph).Gives a BIC score for a linear, Gaussian MAG (Mixed Ancestral Graph).Gives a BIC score for a linear, Gaussian MAG (Mixed Ancestral Graph).Represents a Gaussian mixture model -- a dataset with data sampled from two or more multivariate Gaussian distributions.Implements the MMHC algorithm.Implements the Min-Max Markov Blanks (MMMB) algorithm as defined in Tsamardinos, Aliferis, and Statnikov, Time and Sample Efficient Discovery of Markov Blankets and Direct Causal Relations (KDD 2003).Calculates Mixed Variables Polynomial likelihood.Implements a mixed variable polynomial BIC score for fGES.Uses BCInference by Cooper and Bui to calculate probabilistic conditional independence judgments.Utilities for resolving inconsistencies that arise between sepsets learned for overlapping datasets.A method for combining p values.Implements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.Implements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.Implements the continuous BIC score for FGES.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 an ordered sextad of variables.Implements the "fast adjacency search" used in several causal algorithm in this package.Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.An enum of triple types.Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.An enum of the types of triples that can be found in a graph.Implements the Washdown algorithm,