Approximating probabilistic inference in Bayesian belief networks is NP-hard
Artificial Intelligence
Blocking Gibbs sampling in very large probabilistic expert systems
International Journal of Human-Computer Studies - Special issue: real-world applications of uncertain reasoning
LAZY propagation: a junction tree inference algorithm based on lazy evaluation
Artificial Intelligence
An Introduction to Variational Methods for Graphical Models
Machine Learning
Importance sampling in Bayesian networks using probability trees
Computational Statistics & Data Analysis
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Simulation and the Monte Carlo Method
Simulation and the Monte Carlo Method
Stable local computation with conditional Gaussian distributions
Statistics and Computing
Mixtures of Truncated Exponentials in Hybrid Bayesian Networks
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Approximate probability propagation with mixtures of truncated exponentials
International Journal of Approximate Reasoning
Inference in hybrid Bayesian networks using dynamic discretization
Statistics and Computing
Theoretical analysis and practical insights on importance sampling in Bayesian networks
International Journal of Approximate Reasoning
Belief update in CLG Bayesian networks with lazy propagation
International Journal of Approximate Reasoning
Arc reversals in hybrid Bayesian networks with deterministic variables
International Journal of Approximate Reasoning
Bayesian Networks and Decision Graphs
Bayesian Networks and Decision Graphs
Journal of Artificial Intelligence Research
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
Efficiency of influence diagram models with continuous decision variables
Decision Support Systems
Dynamic importance sampling in Bayesian networks based on probability trees
International Journal of Approximate Reasoning
Learning hybrid Bayesian networks using mixtures of truncated exponentials
International Journal of Approximate Reasoning
Improvements to message computation in lazy propagation
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
Probabilistic graphical models in artificial intelligence
Applied Soft Computing
Predicting consumer sentiments from online text
Decision Support Systems
Mining comparative opinions from customer reviews for Competitive Intelligence
Decision Support Systems
Inference in hybrid Bayesian networks using mixtures of polynomials
International Journal of Approximate Reasoning
Knowledge and Information Systems
Join tree propagation utilizing both arc reversal and variable elimination
International Journal of Approximate Reasoning
Exact inference in networks with discrete children of continuous parents
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Nonuniform dynamic discretization in hybrid networks
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Mixtures of truncated basis functions
International Journal of Approximate Reasoning
Importance sampling algorithms for Bayesian networks: Principles and performance
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
In this paper we propose an algorithm for answering queries in hybrid Bayesian networks where the underlying probability distribution is of class MTE (mixture of truncated exponentials). The algorithm is based on importance sampling simulation. We show how, like existing importance sampling algorithms for discrete networks, it is able to provide answers to multiple queries simultaneously using a single sample. The behaviour of the new algorithm is experimentally tested and compared with previous methods existing in the literature.