Skip to content

Explanation and analysis

Analysing inference with JunctionTreeGenerator

This tools aimed to provide some different views on the Bayesian network in order to explore its qualitative and/or quantitave behaviours.

JunctionTreeGenerator is use to generate junction tree or binary junction tree from Bayesian networks.

JunctionTreeGenerator() -> JunctionTreeGenerator : default constructor

Computes the binary joint tree for its parameters. If the first parameter is a graph, the heurisitcs assume that all the node have the same domain size (2). If given, the heuristic takes into account the partial order for its elimination order.

  • Parameters:
  • Returns: the current binary joint tree
  • Return type: pyagrum.JunctionTree

Computes the elimination for its parameters. If the first parameter is a graph, the heurisitcs assume that all the node have the same domain size (2). If given, the heuristic takes into account the partial order for its elimination order.

  • Parameters:
  • Returns: the current elimination order.
  • Return type: list[int]

Computes the junction tree for its parameters. If the first parameter is a graph, the heurisitcs assume that all the node have the same domain size (2). If given, the heuristic takes into account the partial order for its elimination order.

  • Parameters:
  • Returns: the current junction tree.
  • Return type: pyagrum.JunctionTree

Class building the essential graph from a BN.

Essential graph is a mixed graph (Chain Graph) that represents the class of markov equivalent Bayesian networks (with the same independency model).

EssentialGraph(m) -> EssentialGraph : Parameters: : - m (pyagrum.DAGmodel) – a DAGmodel

adjacency matrix from a graph/graphical models

Compute the adjacency matrix of a pyAgrum’s graph or graphical models (more generally an object that has nodes, children/parents or neighbours methods)

  • Returns: adjacency matrix (as numpy.ndarray) with nodeId as key.
  • Return type: numpy.ndarray

give the set of nodeid of ancestors of a node

  • Parameters: norid (str *|*int) – the name or the id of the node
  • Returns: the set of ids of the ancestors of node norid.
  • Return type: set[int]
  • Returns: The lisf of arcs in the EssentialGraph
  • Return type: set[tuple[int, int]]
  • Parameters: id (int) – the id of the parent
  • Returns: the set of all the children
  • Return type: set[int]

Return the connected components of the essential graph.

Each node is mapped to the id of its component root (an arbitrarily chosen node from the same component).

  • Returns: mapping node id → component root id
  • Return type: dict[int, int]

number of connected components

  • Returns: the number of connected components in the graph.
  • Return type: int

connected components as a dict of sets

  • Returns: dict of connected components (as sets of nodeIds) keyed by an arbitrary root nodeId per component.
  • Return type: dict(int, set[int])

give the set of nodeid of descendants of a node

  • Parameters: norid (str *|*int) – the name or the id of the node
  • Returns: the set of ids of the descendants of node norid.
  • Return type: set[int]
  • Returns: the list of the edges
  • Return type: set[tuple[int, int]]
  • Parameters: name (str) – the name of the variable in the model
  • Returns: the nodeId from the name of the variable in the model
  • Return type: int
  • Parameters: node (int) – the nodeId of the variable in the model
  • Returns: the name of the variable in the model from the nodeId
  • Return type: str
  • Parameters: id (int) – the id of the checked node
  • Returns: The set of edges adjacent to the given node
  • Return type: set[int]

Return the set of node ids in the essential graph.

  • Returns: the set of all node ids
  • Return type: set[int]
  • Parameters: id (int) – The id of the child node
  • Returns: the set of the parents ids.
  • Return type: set[int]
  • Returns: the PDAG (Partially Directed Graph)
  • Return type: PDAG
  • Returns: the number of nodes in the graph
  • Return type: int
  • Returns: the number of arcs in the graph
  • Return type: int
  • Returns: the number of edges in the graph
  • Return type: int
  • Returns: the number of nodes in the graph
  • Return type: int

Return the skeleton of the essential graph (the underlying undirected graph without arc orientations).

  • Returns: the skeleton of the essential graph
  • Return type: UndiGraph
  • Parameters: options (pyagrum.DotOptions , optional) – what is given to the drawing beyond the look of pyagrum.config (size, label, colors of some nodes, width of some arcs…).
  • Returns: a friendly display of the graph in DOT format
  • Return type: str

Class building the Markov blanket of a node in a graph.

MarkovBlanket(m,n) -> MarkovBlanket : Parameters: : - m (pyagrum.DAGmodel) – a DAGmodel - n (int) – a node id

MarkovBlanket(m,name) -> MarkovBlanket : Parameters: : - m (pyagrum.DAGmodel) – a DAGmodel - name (str) – a node name

adjacency matrix from a graph/graphical models

Compute the adjacency matrix of a pyAgrum’s graph or graphical models (more generally an object that has nodes, children/parents or neighbours methods)

  • Returns: adjacency matrix (as numpy.ndarray) with nodeId as key.
  • Return type: numpy.ndarray

give the set of nodeid of ancestors of a node

  • Parameters: norid (str *|*int) – the name or the id of the node
  • Returns: the set of ids of the ancestors of node norid.
  • Return type: set[int]
  • Returns: the list of the arcs
  • Return type: set[tuple[int, int]]
  • Parameters: id (int) – the id of the parent
  • Returns: the set of all the children
  • Return type: set[int]

number of connected components

  • Returns: the number of connected components in the graph.
  • Return type: int

connected components as a dict of sets

  • Returns: dict of connected components (as sets of nodeIds) keyed by an arbitrary root nodeId per component.
  • Return type: dict(int, set[int])
  • Returns: a copy of the DAG
  • Return type: DAG

give the set of nodeid of descendants of a node

  • Parameters: norid (str *|*int) – the name or the id of the node
  • Returns: the set of ids of the descendants of node norid.
  • Return type: set[int]
  • Parameters:
    • pyagrum.DAGmodel – a direct acyclic model
    • other (pyagrum.DAGmodel)
  • Returns: True if all the named node are the same and all the named arcs are the same
  • Return type: bool
  • Returns: the set of ids
  • Return type: set[int]
  • Parameters: id (int) – The id of the child node
  • Returns: the set of the parents ids.
  • Return type: set[int]
  • Returns: the number of nodes in the graph
  • Return type: int
  • Returns: the number of arcs in the graph
  • Return type: int
  • Returns: the number of nodes in the graph
  • Return type: int
  • Parameters: options (pyagrum.DotOptions , optional) – what is given to the drawing beyond the look of pyagrum.config (size, label, colors of some nodes, width of some arcs…).
  • Returns: a friendly display of the graph in DOT format
  • Return type: str