There are three families of exact methods used for probabilistic inference in
belief nets. It is necessary to compare them and analyze the advantages and
the disadvantages of each algorithm, and know the time cost of making
inferences in a given belief network. This paper discusses the factors that
influence the computation time of each algorithm, presents the predictive model
of the time complexity for each algorithm and shows the statistical results of
testing the algorithms with randomly generated belief networks. / Graduation date: 1991
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/37963 |
| Date | 16 November 1990 |
| Creators | Li, Zhaoyu |
| Contributors | D'Ambrosio, Bruce D. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0017 seconds