Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 77))

  • 1578 Accesses

Abstract

We study the decomposition of probability trees as a product of factors with reduced domains. We introduce exact and approximate factorisation techniques with respect to a median of proportional sub-trees as an alternative to the factorisation with average free term.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Boutilier, C., Friedman, N., Goldszmidt, M., Koller, D.: Context-specific independence in Bayesian networks. In: Horvitz, E., Jensen, F. (eds.) Proceedings of the 12th Conf. on Uncertainty in Artificial Intelligence, UAI 1996, Portland, Oregon, USA, pp. 115–123. Morgan Kaufman Publishers, San Francisco (1996)

    Google Scholar 

  2. Cano, A., Moral, S.: Propagación exacta y aproximada con árboles de probabilidad. In: Actas De La VII Conferencia De La Asociación Española Para La Inteligencia Artificial, CAEPIA 1997, Málaga, Spain, pp. 635–644 (1997)

    Google Scholar 

  3. Cano, A., Moral, S., Salmerón, A.: Penniless propagation in join trees. Internat. J. Intell. Syst. 15, 1027–1059 (2000)

    Article  MATH  Google Scholar 

  4. Cano, A., Moral, S., Salmerón, A.: Lazy evaluation in Penniless propagation over join trees. Networks 39, 175–185 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Martínez, I., Moral, S., Rodríguez, C., Salmerón, A.: Approximate factorisation of probability trees. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 51–62. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Martínez, I., Moral, S., Rodríguez, C., Salmerón, A.: Approximate decomposition of probabilistic potentials in Bayesian networks. Technical Report (2010)

    Google Scholar 

  8. Salmerón, A., Cano, A., Moral, S.: Importance sampling in Bayesian networks using probability trees. Comput. Statist. Data Anal. 34, 387–413 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martínez, I., Rodríguez, C., Salmerón, A. (2010). Probability Tree Factorisation with Median Free Term. In: Borgelt, C., et al. Combining Soft Computing and Statistical Methods in Data Analysis. Advances in Intelligent and Soft Computing, vol 77. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14746-3_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14746-3_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14745-6

  • Online ISBN: 978-3-642-14746-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics