Directed acyclic graph (DAG)
Definition
A graph in which edges have a direction (from parent to child node) and no path can return to a node it has already visited. The acyclic constraint ensures the conditional independence structure is well-defined and that probability inference algorithms can terminate.
Related terms
- Belief propagation
- An algorithm for computing marginal and posterior probabilities in a Bayesian network by passing messages between neighbouring nodes. Exact on tree-structured networks;...
- Conditional probability table (CPT)
- A table that specifies the probability distribution of a node given every combination of states of its parent nodes. Every non-root node...
- D-separation
- A graphical criterion that determines whether two sets of nodes in a Bayesian network are conditionally independent given a third set. If...
- Mixture likelihood ratio
- The ratio of the probability of observing a mixed DNA profile if the person of interest is a contributor to the probability...
- Sensitivity analysis
- A technique for assessing how much the posterior probabilities in a Bayesian network change when the values in the conditional probability tables...
Explained in
- Bayesian Networks for Complex EvidenceA graph in which edges have a direction (from parent to child node) and no path can return to a node it has already visited. The acyclic constraint ensures the...