Package edu.cmu.tetrad.search

Class TwoStep.Result

java.lang.Object
edu.cmu.tetrad.search.TwoStep.Result
Enclosing class:
TwoStep
public static final class TwoStep.Result extends Object
The Result class encapsulates the output of the TwoStep algorithm's search process. It contains the resulting coefficient matrix and the directed graph representation.

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    final org.ejml.simple.SimpleMatrix
    B
    A coefficient matrix representing the relationships between variables in the output of the TwoStep algorithm.
    final Graph
    graph
    A directed graph representing the relationships between variables as inferred from the coefficient matrix after pruning.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Result(org.ejml.simple.SimpleMatrix B, Graph g)
    Constructs a Result object that encapsulates the output of the TwoStep algorithm.

  • Method Summary

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Field Details

    • B

      public final org.ejml.simple.SimpleMatrix B
      A coefficient matrix representing the relationships between variables in the output of the TwoStep algorithm. This matrix is of dimensions p x p, where p is the number of variables being analyzed. Non-zero entries in the matrix typically indicate directional dependencies or interactions between variables.

    • graph

      public final Graph graph
      A directed graph representing the relationships between variables as inferred from the coefficient matrix after pruning. An edge exists from node j to node i (j -> i) if and only if the pruned coefficient matrix contains a non-zero entry at B[i, j].

  • Constructor Details

    • Result

      public Result(org.ejml.simple.SimpleMatrix B, Graph g)
      Constructs a Result object that encapsulates the output of the TwoStep algorithm.
      Parameters:
      B - the coefficient matrix representing the relationships between variables in the output. The matrix is of dimensions p x p, where p is the number of analyzed variables. Non-zero entries indicate directional dependencies or interactions between variables.
      g - the directed graph representing the relationships between variables after pruning. An edge from node j to node i (j -> i) exists if and only if the pruned coefficient