Intermediate Node
(Redirected from intermediate node)
Jump to navigation
Jump to search
An Intermediate Node is a Directed Graph Graph Node with a Parent Node and a Child Node.
- AKA: Intermediate Vertex.
- See: Root Node, Child Node, Markov Blanket.
References
2003
- (Korb & Nicholson, 2003) ⇒ Kevin B. Korb, and Ann E. Nicholson. (2003). “Bayesian Artificial Intelligence." Chapman & Hall/CRC.
- In talk about about network structure it is useful to employ a family metaphor: a node is a parent of a child, if there is an arc from the former to the latter. Extending the metaphor, if there is a directed chain of nodes, no node is an ancestor of another if it appears earlier in the chain, whereas a node is a descendant of another node if it is comes later in the chain. … Another useful concept is that of the Markov Blanket of a node, which consists of the node's parents, its children and its children's parents. .. Any node without parents is called a root node, while any node without children is called a leaf node. Any other node (non-leaf and non-root) is called an intermediate node.