Issue No. 03 - March (1993 vol. 15)

ISSN: 0162-8828

pp: 246-255

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.204906

ABSTRACT

<p>A belief network comprises a graphical representation of dependencies between variables of a domain and a set of conditional probabilities associated with each dependency. Unless rho =NP, an efficient, exact algorithm does not exist to compute probabilistic inference in belief networks. Stochastic simulation methods, which often improve run times, provide an alternative to exact inference algorithms. Such a stochastic simulation algorithm, D-BNRAS, which is a randomized approximation scheme is presented. To analyze the run time, belief networks are parameterized, by the dependence value D/sub xi /, which is a measure of the cumulative strengths of the belief network dependencies given background evidence xi . This parameterization defines the class of f-dependence networks. The run time of D-BNRAS is polynomial when f is a polynomial function. Thus, the results prove the existence of a class of belief networks for which inference approximation is polynomial and, hence, provably faster than any exact algorithm.</p>

INDEX TERMS

probabilistic inference approximation; reasoning; Bayesian belief networks; conditional probabilities; stochastic simulation algorithm; D-BNRAS; polynomial; Bayes methods; belief maintenance; inference mechanisms; polynomials; probabilistic logic; uncertainty handling

CITATION

P. Dagum and R. Chavez, "Approximating Probabilistic Inference in Bayesian Belief Networks," in

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 15, no. , pp. 246-255, 1993.

doi:10.1109/34.204906

CITATIONS