Package edu.cmu.tetrad.algcomparison.algorithm
package edu.cmu.tetrad.algcomparison.algorithm
-
ClassDescriptionThis is a base class for bootstrap algorithms.A base class for bootstrapping multi-dataset algorithms (such as IMaGES), parallel to
AbstractBootstrapAlgorithmfor single-dataset algorithms.Interface that algorithm must implement.Aug 30, 2017 3:14:40 PMA list of algorithm to be compared.Tags an an algorithm that loads up external graphs for inclusion in reports.A tagging interface for algorithms that can be used for latent structure search.First inflection point.A tagging interface for algorithms that can be used for latent structure search.Implements an algorithm that takes multiple data sets as input.ReturnsBootstrapGraphs interface.Stability selection: runs the wrapped algorithm on resamples of the data and returns the graph containing exactly those edges (with orientation) appearing in more than "percentStability" of the resample graphs.StARS (Stability Approach to Regularization Selection): selects a value for one numeric parameter of a wrapped algorithm by sweeping the parameter over [low, high] in steps of 0.5, measuring the StARS adjacency instability of the algorithm's output over a fixed set of resamples at each value, choosing the value with the largest instability strictly below the cutoff (Params "StARS.cutoff"), and then running the wrapped algorithm on the full data at the chosen value.Tags algorithm comparison wrappers that can take a covariance matrix as input.