Efficient Search-Based Inference for Noisy-OR Belief Networks: TopEpsilon

02/13/2013
by   Kurt Huang, et al.
0

Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been shown to be more efficient. In this paper, we present a search-based algorithm for approximate inference on arbitrary, noisy-OR belief networks, generalizing earlier work on search-based inference for two-level, noisy-OR belief networks. Initial experimental results appear promising.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset