Junction Tree
(Redirected from junction tree)
Jump to navigation
Jump to search
A Junction Tree is a decomposed tree that is a spanning tree over a clique.
- AKA: Tree Decomposition, Clique Tree, Join Tree.
- See: Matrix Decomposition, Graph Theory, Graph (Discrete Mathematics), Tree (Graph Theory), Treewidth, Machine Learning, Belief Propagation, Constraint Satisfaction, Query Optimization.
References
2016
- (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/Tree_decomposition Retrieved:2016-8-13.
- In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain computational problems on the graph.
In machine learning, tree decompositions are also called junction trees, clique trees, or join trees ; they
play an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.
The concept of tree decompositions was originally introduced by . Later it was rediscovered by and has since been studied by many other authors. [1]
- In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain computational problems on the graph.
- ↑ pp.354–355