166 citations · 219 across the 5 of their papers we have counts for
5 papers
A computational scheme for Reasoning in Dynamic Probabilistic Networks
Uffe Kjærulff
A computational scheme for reasoning about dynamic systems using (causal) probabilistic networks is presented. The scheme is based on the framework of Lauritzen and Spiegelhalter (…
Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependencies
Uffe Kjærulff
The paper presents a method for reducing the computational complexity of Bayesian networks through identification and removal of weak dependencies (removal of links from the (moral…
Nested Junction Trees
Uffe Kjærulff
The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy architectures can be improved by exploiting the independence relations induced by the incoming me…
Using ROBDDs for Inference in Bayesian Networks with Troubleshooting as an Example
Thomas D. Nielsen, Pierre-Henri Wuillemin, Finn Verner Jensen +1
When using Bayesian networks for modelling the behavior of man-made machinery, it usually happens that a large part of the model is deterministic. For such Bayesian networks determ…
Making Sensitivity Analysis Computationally Efficient
Uffe Kjærulff, Linda C. van der Gaag
To investigate the robustness of the output probabilities of a Bayesian network, a sensitivity analysis can be performed. A one-way sensitivity analysis establishes, for each of th…