mlsanityData to 7 Oct 2026

Binary Join Trees

arXiv 1302.3604 ↗First posted 13 Feb 2013cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 13 Feb 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.

  1. 2022Causal Inference Using Tractable Circuitscited by 12