Package edu.cmu.tetrad.search

Class Ccd

java.lang.Object
edu.cmu.tetrad.search.Ccd
All Implemented Interfaces:
GraphSearch
public final class Ccd extends Object implements GraphSearch
This class provides the data structures and methods for carrying out the Cyclic Causal Discovery algorithm (CCD) described by Thomas Richardson and Peter Spirtes in Chapter 7 of Computation, Causation, and Discovery by Glymour and Cooper eds. The comments that appear below are keyed to the algorithm specification on pp. 269-271. The search method returns an instance of a Graph but it also constructs two lists of node triples which represent the underlines and dotted underlines that the algorithm discovers.
Author:
Frank C. Wimberly, Joseph Ramsey

  • Constructor Details

  • Method Details

    • search

      public Graph search()
      The search method assumes that the IndependenceTest provided to the constructor is a conditional independence oracle for the SEM (or Bayes network) which describes the causal structure of the population. The method returns a PAG instantiated as a Tetrad GaSearchGraph which represents the equivalence class of digraphs which are d-separation equivalent to the digraph of the underlying model (SEM or BN). Although they are not returned by the search method it also computes two lists of triples which, respectively store the underlines and dotted underlines of the PAG.
      Specified by:
      search in interface GraphSearch

    • getKnowledge

      public Knowledge getKnowledge()

    • getDepth

      public int getDepth()

    • setDepth

      public void setDepth(int depth)

    • setKnowledge

      public void setKnowledge(Knowledge knowledge)

    • getElapsedTime

      public long getElapsedTime()

    • isApplyR1

      public boolean isApplyR1()

    • setApplyR1

      public void setApplyR1(boolean applyR1)