Package edu.cmu.tetrad.search

Class AdLeafTree

java.lang.Object
edu.cmu.tetrad.search.AdLeafTree
public class AdLeafTree extends Object
Constructs and AD leaf tree on the fly. Probably doesn't speed up the first algorithm it's used for much, but it should speed up subsequent algorithm on the same data. Continuous variables in the data set are ignored.
Author:
Joseph Ramsey

  • Constructor Details

    • AdLeafTree

      public AdLeafTree(DataSet dataSet)

  • Method Details

    • getCellLeaves

      public List<List<Integer>> getCellLeaves(List<DiscreteVariable> A)
      Finds the set of indices into the leaves of the tree for the given variables. Counts are the sizes of the index sets.
      Parameters:
      A - A list of discrete variables.
      Returns:
      The list of index sets of the first variable varied by the second variable, and so on, to the last variable.

    • getCellLeaves

      public List<List<List<Integer>>> getCellLeaves(List<DiscreteVariable> A, DiscreteVariable B)
      Finds the set of indices into the leaves of the tree for the given variables. Counts are the sizes of the index sets.
      Parameters:
      A - A list of discrete variables.
      Returns:
      The list of index sets of the first variable varied by the second variable, and so on, to the last variable.

    • setColumn

      public void setColumn(DiscreteVariable var, int[] col)