Skip to main content

Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions

  • Conference paper
  • First Online:
Scalable Uncertainty Management (SUM 2017)

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

Included in the following conference series:

  • 563 Accesses

Abstract

Estimating probabilities of a multinomial variable conditioned to a large set of variables is an important problem due to the fact that the number of parameters increases in an exponential way with the number of conditional variables. Some models, such as noisy-or gates make assumptions about the relationships between the variables that assume that the number of parameters is linear. However, there are cases in which these hypothesis do not make sense. In this paper, we present a procedure to estimate a large conditional probability distribution by means of an average of low order conditional probabilities. In this way the number of necessary parameters can be reduced to a quantity which can be estimated with available data. Different experiments show that the quality of the estimations can be improved with respect to a direct estimation.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Abellán, J., Gómez-Olmedo, M., Moral, S.: Some variations on the PC algorithm. In: Proceedings of the Third European Workshop on Probabilistic Graphical Models (PGM 2006), pp. 1–8 (2006)

    Google Scholar 

  2. Acid, S., de Campos, L.M., Castellano, J.G.: Learning bayesian network classifiers: searching in a space of partially directed acyclic graphs. Mach. Learn. 59, 213–235 (2005)

    Article  MATH  Google Scholar 

  3. Buntine, W.: Theory refinement in bayesian networks. In: Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence, pp. 52–60. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B 36, 1–38 (1977)

    MathSciNet  MATH  Google Scholar 

  6. Elvira Consortium: Elvira: an environment for probabilistic graphical models. In: Gmez, J.A., Salmern, A. (eds.) Proceedings of the 1st European Workshop on Probabilistic Graphical Models, pp. 222–230 (2002)

    Google Scholar 

  7. Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Mach. Learn. 29, 131–163 (1997)

    Article  MATH  Google Scholar 

  8. Henrion, M.: Some practical issues in constructing belief networks. In: Kanal, L.N., Levitt, T.S., Lemmer, J.F. (eds.) Uncertainty in Artifjcial Intelligence, vol. 3, pp. 161–173. Elsevier, Amsterdam (1989)

    Google Scholar 

  9. Nielsen, T.D., Jensen, F.V.: Bayesian Networks and Decision Graphs. Information Science and Statistics. Springer, New York (2007). doi:10.1007/978-0-387-68282-2

    MATH  Google Scholar 

  10. Lichman, M.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2013). http://archive.ics.uci.edu/ml

  11. Liu, Z., Malone, B., Yuan, C.: Empirical evaluation of scoring functions for Bayesian network model selection. BMC Bioinform. 13(Suppl 15), S14 (2012)

    Article  Google Scholar 

  12. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)

    MATH  Google Scholar 

  13. Poon, H., Domingos, P.: Sum-product networks: a new deep architecture. In: IEEE International Conference on Computer Vision Workshops (ICCV Workshops), pp. 689–690 (2011)

    Google Scholar 

  14. Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction and Search. Lecture Notes in Statistics. Springer, New York (1993). doi:10.1007/978-1-4612-2748-9

    Book  MATH  Google Scholar 

  15. Zagoreski, A., Druzdzel, M.J.: Knowledge engineering for bayesian networks: how common are noisy-MAX distributions in practice. IEEE Trans. Syst. Man Cybern. Syst. 43, 186–195 (2013)

    Article  Google Scholar 

Download references

Acknowledgments

This research was supported by the Spanish Ministry of Economy and Competitiveness under projects TIN2013-46638-C3-2-P and TIN2016-77902-C3-2-P, and the European Regional Development Fund (FEDER).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Serafín Moral .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Cano, A., Gómez-Olmedo, M., Moral, S. (2017). Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions. In: Moral, S., Pivert, O., Sánchez, D., Marín, N. (eds) Scalable Uncertainty Management. SUM 2017. Lecture Notes in Computer Science(), vol 10564. Springer, Cham. https://doi.org/10.1007/978-3-319-67582-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67582-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67581-7

  • Online ISBN: 978-3-319-67582-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics