Abstract
Mixtures of truncated exponential (MTE) networks are a powerful alternative to discretisation when working with hybrid Bayesian networks. One of the features of the MTE model is that standard propagation algorithm can be used. In this paper we propose an approximate propagation algorithm for MTE networks which is based on the Penniless propagation method already known for discrete variables. The performance of the proposed method is analysed in a series of experiments with random networks.
This work has been supported by the Spanish Ministry of Science and Technology, project Elvira II (TIC2001-2973-C05-02) and by FEDER funds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cano, A., Moral, S.: Heuristic algorithms for the triangulation of graphs. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L. (eds.) Advances in Intelligent Computing, pp. 98–107. Springer, Heidelberg (1995)
Cano, A., Moral, S., Salmerón, A.: Penniless propagation in join trees. International Journal of Intelligent Systems 15, 1027–1059 (2000)
Cano, A., Moral, S., Salmerón, A.: Lazy evaluation in Penniless propagation over join trees. Networks 39, 175–185 (2002)
Cano, A., Moral, S., Salmerón, A.: Novel strategies to approximate probability trees in Penniless propagation. International Journal of Intelligent Systems 18, 193–203 (2003)
Christofides, A., Tanyi, B., Whobrey, D., Christofides, N.: The optimal discretization of probability density functions. Computational Statistics and Data Analysis 31, 475–486 (1999)
Cobb, B., Shenoy, P., Rumí, R.: Approximating probability density functions with mixtures of truncated expoenntials. In: Proceedings of the Tenth International Conference IPMU 2004, Perugia, Italy (2004)
Jensen, F., Andersen, S.K.: Approximations in Bayesian belief universes for knowledge-based systems. In: Proceedings of the 6th Conference on Uncertainty in Artificial Intelligence, pp. 162–169 (1990)
Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in causal probabilistic networks by local computation. Computational Statistics Quarterly 4, 269–282 (1990)
Kjærulff, U.: Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing 2, 1–21 (1992)
Koller, D., Lerner, U., Anguelov, D.: A general algorithm for approximate inference and its application to hybrid Bayes nets. In: Laskey, K.B., Prade, H. (eds.) Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pp. 324–333. Morgan Kaufmann, San Francisco (1999)
Kozlov, D., Koller, D.: Nonuniform dynamic discretization in hybrid networks. In: Geiger, D., Shenoy, P.P. (eds.) Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, pp. 302–313. Morgan Kaufmann, San Francisco (1997)
Lauritzen, S.L.: Propagation of probabilities, means and variances in mixed graphical association models. Journal of the American Statistical Association 87, 1098–1108 (1992)
Lauritzen, S.L., Spiegelhalter, D.J.: 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)
Madsen, A.L., Jensen, F.V.: Lazy propagation: a junction tree inference algorithm based on lazy evaluation. Artificial Intelligence 113, 203–245 (1999)
Moral, S., Rumí, R., Salmerón, A.: Mixtures of truncated exponentials in hybrid Bayesian networks. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 135–143. Springer, Heidelberg (2001)
Moral, S., Rumí, R., Salmerón, A.: Estimating mixtures of truncated exponentials from data. In: Proceedings of the First European Workshop on Probabilistic Graphical Models, pp. 156–167 (2002)
Olesen, K.G.: Causal probabilistic networks with both discrete and continuous variables. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 275–279 (1993)
Salmerón, A., Cano, A., Moral, S.: Importance sampling in Bayesian networks using probability trees. Computational Statistics and Data Analysis 34, 387–413 (2000)
Santos, E., Shimony, S.E., Williams, E.: Hybrid algorithms for approximate belief updating in Bayes nets. International Journal of Approximate Reasoning 17, 191–216 (1997)
Shenoy, P.P., Shafer, G.: Axioms for probability and belief function propagation. In: Shachter, R.D., Levitt, T.S., Lemmer, J.F., Kanal, L.N. (eds.) Uncertainty in Artificial Intelligence 4, pp. 169–198. North Holland, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rumí, R., Salmerón, A. (2005). Penniless Propagation with Mixtures of Truncated Exponentials. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_5
Download citation
DOI: https://doi.org/10.1007/11518655_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)