Class Ion

java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.multi.Ion
All Implemented Interfaces:
Algorithm, MultiDataSetAlgorithm, HasParameters, TakesIndependenceWrapper, TakesScoreWrapper, TetradSerializable, Serializable

Runs the ION (Integration of Overlapping Networks) algorithm on multiple datasets whose variable sets may overlap only partially. BFCI is run separately on each dataset using the chosen independence test and score, and the resulting PAGs are integrated by ION into a set of PAGs over the union of the variables that are consistent with every input PAG.

BFCI is used for the per-dataset searches, rather than FCI, because ION's correctness argument requires that its inputs be legal PAGs, and FCI is not guaranteed to produce a legal PAG, whereas BFCI is designed to. For oracle experiments the analogous choice is GRaSP-FCI with the m-separation test and score.

Reference: Danks, D., Glymour, C., & Tillman, R. E. (2008). Integrating locally learned causal structures with overlapping variables. In Advances in Neural Information Processing Systems 21 (NIPS 2008), pp. 1665-1672.

ION returns an equivalence class of PAGs, which may contain more than one graph; all of them are printed to the log. Since this interface must return a single graph, the graph with the fewest edges is returned, with ties broken by a lexicographic comparison of the printed edge lists, so that the choice is deterministic. If the input PAGs are jointly inconsistent (which can happen when they are estimated from finite samples of different datasets), ION may return no graphs at all; in that case an edgeless graph over the union of the variables is returned and a warning is logged.

Note that ION is exponential in the number of variables and is intended for problems with a small number of variables.

Version:
$Id: $Id
Author:
josephramsey
See Also: