An algorithm directly finding the K most probable configurations in Bayesian networks
Authors:
- B. SeroussiBSB. Seroussi
- J.L. GolmardJGJ.L. Golmard
- 1 October 1994
- journal article
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 11 (3) , 205-233
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Bayesian Analysis in Expert SystemsStatistical Science, 1993
- A recurrence local computation approach towards ordering composite beliefs in bayesian belief networksInternational Journal of Approximate Reasoning, 1993
- Applications of a general propagation algorithm for probabilistic expert systemsStatistics and Computing, 1992
- Optimal decomposition of probabilistic networks by simulated annealingStatistics and Computing, 1992
- An algebra of bayesian belief universes for knowledge‐based systemsNetworks, 1990
- The computational complexity of probabilistic inference using bayesian belief networksArtificial Intelligence, 1990
- Distributed revision of composite beliefsArtificial Intelligence, 1987
- Evidential reasoning using stochastic simulation of causal modelsArtificial Intelligence, 1987
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984