Probabilistic inference in multiply connected belief networks using loop cutsets
From MaRDI portal
Publication:911806
DOI10.1016/0888-613X(90)90003-KzbMath0697.68090MaRDI QIDQ911806
Gregory F. Cooper, H. Jacques Suermondt
Publication date: 1990
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
NP-hardexpert systemsprobabilistic reasoningBayesian methodsloop cutsetmultiply connected belief networks
Related Items
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem ⋮ Local conditioning in Bayesian networks ⋮ Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering ⋮ Fusion and propagation with multiple observations in belief networks ⋮ A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ On evidence absorption for belief networks ⋮ Estimating the probability of meeting a deadline in schedules and plans ⋮ Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations ⋮ Evaluation of Bayesian networks with flexible state-space abstraction methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fusion, propagation, and structuring in belief networks
- Distributed revision of composite beliefs
- Evidential reasoning using stochastic simulation of causal models
- Parallel concepts in graph theory
- The computational complexity of probabilistic inference using Bayesian belief networks
- Iterative algorithms for generating minimal cutsets in directed graphs
- Probabilistic Inference and Influence Diagrams
- Statistical and Knowledge-Based Approaches to Clinical Decision-Support Systems, with an Application in Gastroenterology
