UNSPECIFIED (1999) Fast Bayes and the dynamic junction forest. ARTIFICIAL INTELLIGENCE, 107 (1). pp. 99-124. ISSN 0004-3702

Full text not available from this repository.

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title:	ARTIFICIAL INTELLIGENCE
Publisher:	ELSEVIER SCIENCE BV
ISSN:	0004-3702
Date:	January 1999
Volume:	107
Number:	1
Number of Pages:	26
Page Range:	pp. 99-124
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/14832

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item