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