Skip navigation
Skip navigation

Exploiting within-Clique factorizations in junction-tree algorithms

McAuley, Julian; Caetano, Tiberio

Description

We show that the expected computational complexity of the Junction-Tree Algorithm for maximum a posteriori inference in graphical models can be improved. Our results apply whenever the potentials over maximal cliques of the triangulated graph are factored over subcliques. This is common in many real applications, as we illustrate with several examples. The new algorithms are easily implemented, and experiments show substantial speed-ups over the classical Junction-Tree Algorithm. This enlarges...[Show more]

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
URI: http://hdl.handle.net/1885/58301
Source: Proceedings of The 13th International Conference on Artificial Intelligence and Statistics(AISTATS-2010)

Download

File Description SizeFormat Image
01_McAuley_Exploiting_within-Clique_2010.pdf1.99 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator