Exact Bayesian Inference Algorithm

From GM-RKB
Jump to navigation Jump to search

An Exact Bayesian Inference Algorithm is a Bayesian Inference Algorithm that solves an exact Bayesian inference task.



References

2013

2009

2006

  • (Mott & Lester, 2006) ⇒ Bradford W. Mott, and James C. Lester. (2006). “U-director: A decision-theoretic narrative planning architecture for storytelling environments.” In: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems. doi:10.1145/1160633.1160808
    • QUOTE: Because exact inference in Bayesian networks is known to be extraordinarily inefficient (in the worst case NP-hard), U-DIRECTOR exploits recent advances in approximate Bayesian inference via stochastic sampling. The accuracy of these methods depends on the number of samples used. Moreover, stochastic sampling methods typically have an “anytime” property which is particularly attractive for real-time applications. … a performance analysis was conducted to measure the network update time using an exact Bayesian inference algorithm (Clustering [17]) and two approximate Bayesian inference algorithms (EPIS-BN [36] and Likelihood weighting [31]).

1996

  • (Huang & Darwiche, 1996) ⇒ C. Huang, and A. Darwiche. (1996). “Inference in Belief Networks: a procedural guide.” In: International Journal of Approximate Reasoning, 15(3).