Inference in belief networks: A procedural guide

DOI10.1016/S0888-613X(96)00069-2zbMath0941.68767OpenAlexW2049073556MaRDI QIDQ1809338

Adnan Darwiche, Cecil Huang

Publication date: 20 December 1999

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0888-613x(96)00069-2

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in computer science (03B70) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (22)

Same-decision probability: a confidence measure for threshold-based decisions ⋮ Learning invariant features using inertial priors ⋮ Graph Bisection with Pareto Optimization ⋮ Activity based surveillance video content modelling ⋮ Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems ⋮ On Directed and Undirected Propagation Algorithms for Bayesian Networks ⋮ Hand gesture recognition based on dynamic Bayesian network framework ⋮ Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering ⋮ Diagnosis of Deep Discrete-Event Systems ⋮ GLOBAL PROPAGATION IN BAYESIAN NETWORKS VS SEMIJOIN PROGRAMS IN RELATIONAL DATABASES ⋮ Methods for constructing balanced elimination trees and other recursive decompositions ⋮ Operating with potentials of discrete variables ⋮ Recursive conditioning ⋮ Constant-space reasoning in dynamic Bayesian networks ⋮ Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorption ⋮ Learning probabilistic decision graphs ⋮ Mining Bayesian Networks from Direct Marketing Databases with Missing Values ⋮ STOCHASTIC ANALYSIS OF CELLULAR AUTOMATA WITH APPLICATION TO THE VOTER MODEL ⋮ Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals ⋮ Latent class models for diary method data: Parameter estimation by local computations ⋮ A simple graphical approach for understanding probabilistic inference in Bayesian networks ⋮ A differential semantics for jointree algorithms

Cites Work

• Fusion and propagation with multiple observations in belief networks
• Efficient inference in Bayes networks as a combinatorial optimization problem
• A Bayesian analysis of simulation algorithms for inference in belief networks
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Complexity of Finding Embeddings in a k-Tree
• Independence properties of directed markov fields
• Identifying independence in bayesian networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inference in belief networks: A procedural guide