Factorization of Sparse Bayesian Networks

Studies in Computational Intelligence 199:275-285 (2009)
  Copy   BIBTEX

Abstract

This paper shows how an efficient and parallel algorithm for inference in Bayesian Networks (BNs) can be built and implemented combining sparse matrix factorization methods with variable elimination algorithms for BNs. This entails a complete separation between a first symbolic phase, and a second numerical phase.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Two Conceptions of Sparse Properties.Jonathan Schaffer - 2004 - Pacific Philosophical Quarterly 85 (1):92–102.
Argument diagram extraction from evidential Bayesian networks.Jeroen Keppens - 2012 - Artificial Intelligence and Law 20 (2):109-143.
Factorization of residuated lattices.Michal Krupka - 2009 - Logic Journal of the IGPL 17 (2):205-223.
The difficulty of prime factorization is a consequence of the positional numeral system.Yaroslav Sergeyev - 2016 - International Journal of Unconventional Computing 12 (5-6):453–463.
Active set Methods for Problems in Column Block Angular Form.Julio Michael Stern & Stephen A. Vavasis - 1993 - Computational and Applied Mathematics 12 (3):199-226.

Analytics

Added to PP
2021-07-23

Downloads
205 (#93,227)

6 months
76 (#54,943)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Julio Michael Stern
University of São Paulo

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references