Uses of Package
edu.cmu.tetrad.search

Packages that use edu.cmu.tetrad.search

Package	Description
edu.cmu.tetrad.algcomparison.algorithm.multi
edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern
edu.cmu.tetrad.search	Contains classes for searching for (mostly structural) causal models given data.
edu.cmu.tetrad.search.utils	Contains some utility classes for search algorithms.
edu.cmu.tetrad.search.work_in_progress	Contains some classes that aren't ready for prime time.
edu.pitt.csb.mgm
edu.pitt.dbmi.algo.bayesian.constraint.search

Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.algcomparison.algorithm.multi

Class	Description
Lofs.Rule	Give a list of options for rules for doing the non-Gaussian orientations.

Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern

Class	Description
Cstar.Record	Represents a single record in the returned table for CSTaR.

Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.search

Class	Description
Cstar.CpdagAlgorithm	An enumeration of the options available for estiting the CPDAG used for the algorthm.
Cstar.Record	Represents a single record in the returned table for CSTaR.
Cstar.SampleStyle	An enumeration of the methods for selecting samples from the full dataset.
Fask.AdjacencyMethod	Enumerates the alternatives to use for finding the initial adjacencies for FASK.
Fask.LeftRight	Enumerates the options left-right rules to use for FASK.
FastIca.IcaResult	A list containing the following components
Fofc.Algorithm	Gives the options to be used in FOFC to sort through the various possibilities for forming clusters to find the best options.
Ftfc.Algorithm	Gives the options to be used in FOFC to sort through the various possibilities for forming clusters to find the best options.
Ida.NodeEffects	Gives a list of nodes (parents or children) and corresponding minimum effects for the IDA algorithm.
IFas	Gives an interface for fast adjacency searches (i.e.
IGraphSearch	Gives an interface for a search method that searches and returns a graph.
IMbSearch	Gives an interface for Markov blanket searches.
Lofs.Rule	Give a list of options for rules for doing the non-Gaussian orientations.
Lofs.Score	Gives a list of options for non-Gaussian transformations that can be used for some scores.
SuborderSearch	An interface for suborder searches for various types of permutation algorithms.

Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.search.utils

Class	Description
IGraphSearch	Gives an interface for a search method that searches and returns a graph.

Classes in edu.cmu.tetrad.search used by edu.cmu.tetrad.search.work_in_progress

Class	Description
IFas	Gives an interface for fast adjacency searches (i.e.
IGraphSearch	Gives an interface for a search method that searches and returns a graph.
IMbSearch	Gives an interface for Markov blanket searches.
Lofs.Rule	Give a list of options for rules for doing the non-Gaussian orientations.

Classes in edu.cmu.tetrad.search used by edu.pitt.csb.mgm

Class	Description
IGraphSearch	Gives an interface for a search method that searches and returns a graph.

Classes in edu.cmu.tetrad.search used by edu.pitt.dbmi.algo.bayesian.constraint.search

Class	Description
IGraphSearch	Gives an interface for a search method that searches and returns a graph.
Rfci	Implements the Really Fast Causal Inference (RFCI) algorithm, which aims to do a correct inference of inferrable causal structure under the assumption that unmeasured common causes of variables in the data may exist.