Abstract
Dynamic Belief Networks (DBNs) have become a popular method for monitoring dynamical processes in real-time. However DBN evaluation has the same problems of computational intractability as ordinary belief networks, with additional exponential complexity as the number of time-slices increases. Several approximate methods for fast DBN evaluation have been devised [1,3,11]. We present a new method which simplifies evaluation by selectively “forgetting” past events and their relationships to the present. This is done by pruning, from past time-slices, arcs and nodes which are deemed less relevant to the current time-slice, as determined by the arc weight measure introduced in [15]. This approach is more flexible than a fixed-size window and can be combined with other approximate evaluation techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
X. Boyen and D. Roller. Tractable inference for complex stochastic processes. In UAI’98, pp 33–42, 1998.
Norsys Software Corp. Netica. http://www.norsys.com/.
P. Dagum and A. Galper. Forecasting sleep apnea with dynamic network models. In UAI’93, pp 65–71, 1993.
B. D’Ambrosio. Incremental probabilistic inference. In UAI’93, pp 301–308, 1993.
Thomas Dean and Keiji Kanazawa. A model for reasoning about persistence and causation. Computational Intelligence, 5:142–150, 1989.
Thomas Dean and Michael P. Wellman. Planning and control. Morgan Kaufman Publishers, San Mateo, Ca., 1991.
Denise L. Draper and Steve Hanks. Localized partial evaluation of a belief network. In UAI’94, pp 170–177, 1994.
Jeff Forbes, Tim Huang, Keiji Kanazawa, and Stuart Russell. The BATmobile: Towards a Bayesian automated taxi. In IJCAI’95, pp 1878–1885, 1995.
Finn V. Jensen, Uffe Kjærulff, Kristian G. Olesen, and Jan Pedersen. Et forprojekt til et ekspertsystem for drift af spildevandsrensning (an expert system for control of waste water treatment — a pilot project). Technical report, Judex Datasysterner A/S, Aalborg, Denmark, 1989. In Danish.
N. Jitnah. Arc Weights for Approximate Evaluation of Bayesian Networks. PhD thesis, Monash University, School of Computer Science and Software Engineering, 1999.
K. Kanazawa, D. Koller, and S. Russell. Stochastic simulation algorithms for Dynamic Probabilistic Networks. In UAI’95, pp 346–351, 1995.
U. Kjærulff. A computational scheme for reasoning in Dynamic Probabilistic Net works. In UAI’92, pp 121–129, 1992.
Uffe Kjaerulff. Reduction of computation complexity in bayesian networks through removal of weak dependencies. In UAI’94, pp 374–382, 1994.
A. E. Nicholson and J. M. Brady. Dynamic belief networks for discrete monitoring. IEEE Systems, Man and Cybernetics, 24(11):1593–1610, 1994.
Ann E. Nicholson and Nathalie Jitnah. Using Mutual Information to determine relevance in Bayesian Networks. In Hing-Yan Lee and Hiroshi Motoda, editors, PRICAI’98: Topics in Artificial Intelligence, volume 1531 of LNCS/LNAI Series, pp 399–410, Singapore, 1998. Springer.
J. Pearl. Probabilistic Reasoning In Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
K. L. Poh and E Horvitz. Topological proximity and relevance in graphical decision models. In UAI’96, pp 427–435, 1996.
C. E. Shannon and W. Weaver. The mathematical theory of communication. University of Illinois Press, 1949.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jitnah, N., Nicholson, A.E. (1999). Arc Weights for Approximate Evaluation of Dynamic Belief Networks. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_33
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive