An Efficient New Junction Tree Architecture

The Hugin and Shafer-Shenoy architectures are variations on the junction tree algorithm which tradeoff space and time complexities in different ways. The Hugin architecture is faster than that of Shafer-Shenoy but at the cost of a greater space complexity. This paper presents a new architecture which, in the cases where there exist relatively large vertices of the junction tree J with very high degree (or many small corresponding factors), is significantly faster than Hugin propagation. The new architecture also has a lower space complexity than Hugin propagation.