Minimal and memory efficient implementation of the junction tree algorithm using the Lauritzen-Spiegelhalter scheme.
Maintainer: Mads Lindskou madslindskou@gmail.com
The main functions are cpt_list
, compile
,jt
and query_belief
which together is sufficient to make
inference using the junction tree algorithm.
Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems by S. L. Lauritzen and D. J. Spiegelhalter (1988). Journal of the Royal Statistical Society: Series B (Methodological) volume 50, issue 2.
Useful links: