ML Anthology

The Efficient Propagation of Arbitrary Subsets of Beliefs in Discrete-Valued Bayesian Networks

Duncan Smith
AISTATS 2001 pp. 272-277
/aistats/2001/smith2001aistats-efficient/

Abstract

The paper describes an approach for propagating arbitrary subsets of beliefs in Bayesian Belief Networks. The method is based on a multiple message passing scheme in junction trees. A hybrid tree structure is introduced, both for the propagation of evidence and as an efficiently permutable representation of a decomposable graph. The use of maximal prime subgraph decompositions and tree permutations to reduce computational cost is demonstrated.

PDF AISTATS Semantic Scholar

Cite

Text

Smith. "The Efficient Propagation of Arbitrary Subsets of Beliefs in Discrete-Valued Bayesian Networks." Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, 2001.

Markdown

[Smith. "The Efficient Propagation of Arbitrary Subsets of Beliefs in Discrete-Valued Bayesian Networks." Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, 2001.](https://mlanthology.org/aistats/2001/smith2001aistats-efficient/)

BibTeX

@inproceedings{smith2001aistats-efficient,
  title     = {{The Efficient Propagation of Arbitrary Subsets of Beliefs in Discrete-Valued Bayesian Networks}},
  author    = {Smith, Duncan},
  booktitle = {Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics},
  year      = {2001},
  pages     = {272-277},
  volume    = {R3},
  url       = {https://mlanthology.org/aistats/2001/smith2001aistats-efficient/}
}