An algebra of bayesian belief universes for knowledge‐based systems
From MaRDI portal
Publication:5752000
DOI10.1002/NET.3230200509zbMATH Open0719.68081OpenAlexW2045191911MaRDI QIDQ5752000FDOQ5752000
Finn V. Jensen, Kristian G. Olesen, Stig Kjaer Andersen
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200509
Recommendations
Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
Cited In (39)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
- Irrelevance and parameter learning in Bayesian networks
- Title not available (Why is that?)
- Hyper-EM for large recursive models of categorical variables.
- Tractable minor-free generalization of planar zero-field Ising models
- Fast Bayes and the dynamic junction forest
- Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
- Factorization of posteriors and partial imputation algorithm for graphical models with missing data.
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Exploiting case-based independence for approximating marginal probabilities
- Unifying tree decompositions for reasoning in graphical models
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Knowledge representation and inference in similarity networks and Bayesian multinets
- Evaluation of Bayesian networks with flexible state-space abstraction methods
- Computing marginals for arbitrary subsets from marginal representation in Markov trees
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Title not available (Why is that?)
- A computational theory of decision networks
- Belief networks revisited
- Fusion, propagation, and structuring in belief networks
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- Efficient computation for the noisy MAX
- Title not available (Why is that?)
- Join tree propagation with prioritized messages
- Independence of causal influence and clique tree propagation
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
- An information theory approach to nonlinear, nonequilibrium thermodynamics
- A probabilistic framework for cooperative multi-agent distributed interpretation and optimization of communication
- Bayesian networks: regenerative Gibbs samplings
- Title not available (Why is that?)
- DISTRIBUTED INFERENCE IN BAYESIAN NETWORKS
- Title not available (Why is that?)
- Fusion and propagation with multiple observations in belief networks
- Title not available (Why is that?)
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
- Operating with potentials of discrete variables
- Local conditioning in Bayesian networks
This page was built for publication: An algebra of bayesian belief universes for knowledge‐based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752000)
