Skip to main content

Approximating Conditional MTE Distributions by Means of Mixed Trees

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2711))

Abstract

Mixtures of truncated exponential (MTE) distributions have been shown to be a powerful alternative to discretisation within the framework of Bayesian networks. One of the features of the MTE model is that standard propagation algorithms as Shenoy-Shafer and Lazy propagation can be used. Estimating conditional MTE densities from data is a rather difficult problem since, as far as we know, such densities cannot be expressed in parametric form in the general case. In the univariate case, regression-based estimators have been successfully employed. In this paper, we propose a method to estimate conditional MTE densities using mixed trees, which are graphical structures similar to classification trees. Criteria for selecting the variables during the construction of the tree and for pruning the leaves are defined in terms of the mean square error and entropy-like measures.

This work has been supported by the Spanish Ministry of Science and Technology, project Elvira II (TIC2001-2973-C05-01 and 02)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cano, A., Moral, S., Salmerón, A.: Penniless propagation in join trees. International Journal of Intelligent Systems 15, 1027–1059 (2000)

    Article  MATH  Google Scholar 

  2. 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)

    MathSciNet  Google Scholar 

  3. 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)

    Google Scholar 

  4. Lauritzen, S.L.: Propagation of probabilities, means and variances in mixed graphical association models. Journal of the American Statistical Association 87, 1098–1108 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    MATH  MathSciNet  Google Scholar 

  6. Madsen, A.L., Jensen, F.V.: Lazy propagation: a junction tree inference algorithm based on lazy evaluation. Artificial Intelligence 113, 203–245 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. 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)

    Google Scholar 

  9. Olesen, K.G.: Causal probabilistic networks with both discrete and continuous variables. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 275–279 (1993)

    Article  Google Scholar 

  10. Pearl, J.: Probabilistic reasoning in intelligent systems. Morgan-Kaufmann, San Mateo (1988)

    Google Scholar 

  11. Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81–106 (1986)

    Google Scholar 

  12. Salmerón, A., Cano, A., Moral, S.: Importance sampling in Bayesian networks using probability trees. Computational Statistics and Data Analysis 34, 387–413 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moral, S., Rumí, R., Salmerón, A. (2003). Approximating Conditional MTE Distributions by Means of Mixed Trees. In: Nielsen, T.D., Zhang, N.L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2003. Lecture Notes in Computer Science(), vol 2711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45062-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45062-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40494-1

  • Online ISBN: 978-3-540-45062-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics