Affordable Access

Fast Bayes and the dynamic junction forest

Publisher
ELSEVIER SCIENCE BV
Publication Date
Keywords
  • Qa76 Electronic Computers. Computer Science. Computer Software
Disciplines
  • Computer Science

Abstract

It has been shown that junction tree algorithms can provide a quick and efficient method for propagating probabilities in complex multivariate problems when they can be described by a fixed conditional independence structure. In this paper we formalise and illustrate with two practical examples how these probabilistic propagation algorithms can be applied to high dimensional processes whose conditional independence structure, as well as their underlying distributions, are augmented through the passage of time. (C) 1999 Elsevier Science B.V. All rights reserved.

There are no comments yet on this publication. Be the first to share your thoughts.