Package edu.cmu.tetrad.search
Class MbUtils
java.lang.Object
edu.cmu.tetrad.search.MbUtils
Some useful utilities for dealing with Markov blankets and Markov blanket DAGs.
- Author:
- Joseph Ramsey
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiongenerateMbDags
(Graph mbCPDAG, boolean orientBidirectedEdges, IndependenceTest test, int depth, Node target) Generates the list of MB DAGs consistent with the MB CPDAG returned by the previous search.static Graph
getOneMbDag
(Graph mbCPDAG) static void
trimEdgesAmongParents
(Graph graph, Node target) Removes edges among the parents of the target.static void
trimEdgesAmongParentsOfChildren
(Graph graph, Node target) Removes edges among the parents of children of the target.static void
trimToAdjacents
(Graph graph, Node target) static void
trimToMbNodes
(Graph graph, Node target, boolean includeBidirected) Trims the graph to the target, the parents and children of the target, and the parents of the children of the target.
-
Constructor Details
-
MbUtils
public MbUtils()
-
-
Method Details
-
trimToMbNodes
Trims the graph to the target, the parents and children of the target, and the parents of the children of the target. Bidirected edges are interpreted as if they could be oriented in either direction.- Parameters:
includeBidirected
- true if bidirected edges should be included.
-
trimEdgesAmongParents
Removes edges among the parents of the target. -
trimEdgesAmongParentsOfChildren
Removes edges among the parents of children of the target. -
trimToAdjacents
-
generateMbDags
public static List<Graph> generateMbDags(Graph mbCPDAG, boolean orientBidirectedEdges, IndependenceTest test, int depth, Node target) Generates the list of MB DAGs consistent with the MB CPDAG returned by the previous search.- Parameters:
orientBidirectedEdges
- True iff bidirected edges should be oriented as if they were undirected.- Returns:
- a list of Dag's.
-
getOneMbDag
-