Abstract
In this paper we propose the use of mixtures of truncated exponential (MTE) distributions in hybrid Bayesian networks. We study the properties of the MTE distribution and show how exact probability propagation can be carried out by means of a local computation algorithm. One feature of this model is that no restriction is made about the order among the variables either discrete or continuous. Computations are performed over a representation of probabilistic potentials based on probability trees, expanded to allow discrete and continuous variables simultaneously. Finally, a Markov chain Monte Carlo algorithm is described with the aim of dealing with complex networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Cano, S. Moral, and A. Salmerón. Penniless propagation in join trees. International Journal of Intelligent Systems, 15:1027–1059, 2000.
F.V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in causal probabilistic networks by local computation. Gomput Stat Quarterly, 4:269–282, 1990.
D. Koller, U. Lerner, and D. Anguelov. A general algorithm for approximate inference and its application to hybrid Bayes nets. In K.B. Laskey and H. Prade, editors, Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pages 324–333. Morgan & Kauffman, 1999.
D. Kozlov and D. Koller. Nonuniform dynamic discretization in hybrid networks. In D. Geiger and P.P. Shenoy, editors, Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, pages 302–313. Morgan & Kauffman, 1997.
S.L. Lauritzen. Propagation of probabilities, means and variances in mixed graphical association models. Journal of the American Statistical Association, 87:1098–1108, 1992.
S.L. Lauritzen and F. Jensen. Stable local computation with conditional Gaussian distributions. Statistics and Computing, 11:191–203, 2001.
S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50:157–224, 1988.
A.L. Madsen and F.V. Jensen. Lazy propagation: a junction tree inference algorithm based on lazy evaluation. Artif Intell, 113:203–245, 1999.
K.G. Olesen. Causal probabilistic networks with both discrete and continuous variables. IEEE Trans on Pattern Analysis and Machine Intell, 15:275–279, 1993.
J. Pearl. Evidential reasoning using stochastic simulation of causal models. Artificial Intelligence, 32:247–257, 1987.
R.Y. Rubinstein. Simulation and the Monte Carlo Method. Wiley, 1981.
A. Salmerón, A. Cano, and S. Moral. Importance sampling in Bayesian networks using probability trees. Computational Statistics and Data Analysis, 34:387–413, 2000.
P.P. Shenoy and G. Shafer. Axioms for probability and belief function propagation. In R.D. Shachter, T.S. Levitt, J.F. Lemmer, and L.N. Kanal, editors, Uncertainty in Artificial Intelligence 4, pages 169–198. North Holland, Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moral, S., Rumi, R., Salmerón, A. (2001). Mixtures of Truncated Exponentials in Hybrid Bayesian Networks. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive