Binary Join Trees

Shenoy, Prakash P.

Binary Join Trees

UAI 1996 pp. 492-499

/uai/1996/shenoy1996uai-binary/

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.

PDF UAI Semantic Scholar

Cite

Text

Shenoy. "Binary Join Trees." Conference on Uncertainty in Artificial Intelligence, 1996.

Markdown

[Shenoy. "Binary Join Trees." Conference on Uncertainty in Artificial Intelligence, 1996.](https://mlanthology.org/uai/1996/shenoy1996uai-binary/)

BibTeX

@inproceedings{shenoy1996uai-binary,
  title     = {{Binary Join Trees}},
  author    = {Shenoy, Prakash P.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1996},
  pages     = {492-499},
  url       = {https://mlanthology.org/uai/1996/shenoy1996uai-binary/}
}