Class Fci

java.lang.Object
edu.cmu.tetrad.search.Fci
All Implemented Interfaces:
IGraphSearch

public final class Fci extends Object implements IGraphSearch
Implements the Fast Causal Inference (FCI) algorithm due to Peter Spirtes, which addressed the case where latent common causes cannot be assumed not to exist with respect to the data set being analyzed. That is, it is assumed that there may be variables that are not included in the data that nonetheless may be causes of two or more variables that are included in data.

Two alternatives are provided for doing the final orientation step, one due to Peter Spirtes, which is arrow complete, and another due to Jiji Zhang, which is arrow and tail complete.

This algorithm, with the Spirtes final orientation rules, was given in an earlier version of this book:

Spirtes, P., Glymour, C. N., Scheines, R., & Heckerman, D. (2000). Causation, prediction, and search. MIT press.

The algorithm with the Zhang final orientation rules was given in this reference:

Zhang, J. (2008). On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias. Artificial Intelligence, 172(16-17), 1873-1896.

This class is configured to respect knowledge of forbidden and required edges, including knowledge of temporal tiers.

Version:
$Id: $Id
Author:
peterspirtes, clarkglymour, jijizhang, josephramsey
See Also: