Binary join trees for computing marginals in the Shenoy-Shafer architecture
From MaRDI portal
Publication:1809373
DOI10.1016/S0888-613X(97)89135-9zbMath0939.68021MaRDI QIDQ1809373
Publication date: 20 December 1999
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Related Items
FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS, Ordered valuation algebras: A generic framework for approximating inference, Approximation of Data by Decomposable Belief Models, Semiring induced valuation algebras: exact and approximate local computation algorithms, On conditional truncated densities Bayesian networks, Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams, Resource bounded and anytime approximation of belief function computations., Generic local computation, Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach, A valuation-based system approach for risk assessment of belief rule-based expert systems, Causal Belief Inference in Multiply Connected Networks, PRM inference using Jaffray \& Faÿ's local conditioning, Unifying tree decompositions for reasoning in graphical models, Use of Explanation Trees to Describe the State Space of a Probabilistic-Based Abduction Problem, Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation, Inference in hybrid Bayesian networks with mixtures of truncated exponentials, Compositional models and conditional independence in evidence theory, Inference in directed evidential networks based on the transferable belief model, Efficient computation for the noisy MAX, Novel strategies to approximate probability trees in penniless propagation, Scalable importance sampling estimation of Gaussian mixture posteriors in Bayesian networks, Constructing belief functions from sample data using multinomial confidence regions, Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams, Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm, Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals, Dynamic Directed Evidential Networks with Conditional Belief Functions: Application to System Reliability, Lazy evaluation in penniless propagation over join trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability functions on complex pedigrees
- Fusion, propagation, and structuring in belief networks
- Propagating belief functions in qualitative Markov trees
- Uncertain evidence and artificial analysis
- Conditional independence in valuation-based systems
- Local computation with valuations from a commutative semigroup
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Contribution to nonserial dynamic programming
- On Spohn's rule for revision of beliefs
- On the Desirability of Acyclic Database Schemes
- REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS
- Complexity of Finding Embeddings in a k-Tree
- Consistency in Valuation-Based Systems
- Upper and Lower Probabilities Induced by a Multivalued Mapping
