Recursive conditioning
From MaRDI portal
Publication:5940818
DOI10.1016/S0004-3702(00)00069-2zbMath0969.68150MaRDI QIDQ5940818
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Bayesian networksconditioning methodsdecompositional reasoningexact inference in Bayesian networksprobabilistic inferencerecursive conditioningtime-space tradeoff
Related Items (31)
Mixed deterministic and probabilistic networks ⋮ Approximate algorithms for credal networks with binary variables ⋮ Decision analysis networks ⋮ On probabilistic inference by weighted model counting ⋮ Emergent and spontaneous computation of factor relationships from a large factor set ⋮ Exploiting symmetries for scaling loopy belief propagation and relational training ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Dynamic Management of Heuristics for Solving Structured CSPs ⋮ Algorithms and complexity results for persuasive argumentation ⋮ Learning multi-linear representations of distributions for efficient inference ⋮ Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering ⋮ Case-factor diagrams for structured probabilistic modeling ⋮ Subproblem ordering heuristics for AND/OR best-first search ⋮ Marginalization without Summation Exploiting Determinism in Factor Algebra ⋮ A comparison of two approaches for solving unconstrained influence diagrams ⋮ Methods for constructing balanced elimination trees and other recursive decompositions ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models ⋮ Anytime anyspace probabilistic inference ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Computing individual risks based on family history in genetic disease in the presence of competing risks ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ The Independent Choice Logic and Beyond ⋮ A compositional approach to probabilistic knowledge compilation ⋮ AND/OR search spaces for graphical models ⋮ Learning tractable Bayesian networks in the space of elimination orders ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
Cites Work
- Decomposition by clique separators
- Tree clustering for constraint networks
- Fusion and propagation with multiple observations in belief networks
- Separators in graphs with negative and multiple vertex weights
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Inference in belief networks: A procedural guide
- Local conditioning in Bayesian networks
- A Separator Theorem for Planar Graphs
- Generalized Nested Dissection
- Computing the Reliability of Complex Networks
- Decomposable negation normal form
- Nested Dissection of a Regular Finite Element Mesh
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Recursive conditioning
