166 citations · 181 across the 2 of their papers we have counts for
2 papers
cs.AI2013★ 15 cited
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…
cs.AI2013★ 166 cited
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…