Binary Join Trees
Artificial Intelligence
2013-02-18 v1
Abstract
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and sketch a procedure for constructing them.
Keywords
Cite
@article{arxiv.1302.3604,
title = {Binary Join Trees},
author = {Prakash P. Shenoy},
journal= {arXiv preprint arXiv:1302.3604},
year = {2013}
}
Comments
Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)