Abstract
Dynamic Belief Networks (DBNs) have been used for the monitoring and control of stochastic dynamical processes where it is crucial to provide a response in real-time. DBN transition functions are typically specified as conditional probability distributions over a constant time interval. When these functions are used to model dynamic systems with observations that occur at irregular intervals, both exact and approximate DBN inference algorithms are inefficient. This is because the computation of the posterior distribution at an arbitrary time in the future involves repeated application of the fixed time transition model. We draw on research from mathematics and theoretical physics that shows the dynamics inherent to a Markov model can be described as a diffusion process. These systems can be modelled using the Fokker-Planck equation, the solutions of which are the transition functions of the system for arbitrary length time intervals. We show that using these transition functions in a DBN inference algorithm gives significant computational savings compared to the traditional constant time-step model.
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
K. Bar-Shalom and T. E. Fortmann. Tracking and data association. Mathematics in Science and Engineering Series. Academic Press, 1988.
X. Boyen and D. Roller. Tractable inference for complex stochastic processes. In Proceedings of the Fourteenth Conference on Uncertainty in AI, pages 33–42, 1998.
Thomas Dean and Keiji Kanazawa. A model for reasoning about persistence and causation. Computational Intelligence, 5:142–150, 1989.
C.W. Gardiner. Handbook of Stochastic Methods. Springer-Verlag, 1990.
T. Holland, G.J. McGeer and H. Youngren. Autonomous Aerosondes for economical atmospheric soundings anywhere on the globe. Bulletin of the American Meteorological Society, 73(12):1987–1998, 1992.
Nathalie Jitnah and Ann E. Nicholson. Arc weights for approximate evaluation of Dynamic Belief Networks. In Proceedings of the 12th Australian Joint Conference on Artificial Intelligence, AI’99, pages 393–404, Sydney, 1999.
R.E. Kalman. A new approach to linear filtering and prediction problems. Trans. ASME, J. Basic Engineering, 82:34–45, March 1960.
Uffe Kjaerulff. Reduction of computation complexity in Bayesian networks through removal of weak dependencies. In Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, pages 374–382, 1994.
Judea Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo, Ca., 1988.
Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilkin, T.A., Nicholson, A.E. (2000). Efficient Inference in Dynamic Belief Networks with Variable Temporal Resolution. In: Mizoguchi, R., Slaney, J. (eds) PRICAI 2000 Topics in Artificial Intelligence. PRICAI 2000. Lecture Notes in Computer Science(), vol 1886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44533-1_29
Download citation
DOI: https://doi.org/10.1007/3-540-44533-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67925-7
Online ISBN: 978-3-540-44533-3
eBook Packages: Springer Book Archive