Sciweavers

UAI
1996

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

13 years 4 months ago
Efficient Search-Based Inference for noisy-OR Belief Networks: TopEpsilon
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 searchbased algorithm for approximate inference on arbitrary, noisy-OR belief networks, generalizing earlier work on search-based inference for twolevel, noisy-OR belief networks. Initial experimental results appear promising.
Kurt Huang, Max Henrion
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1996
Where UAI
Authors Kurt Huang, Max Henrion
Comments (0)