Share Email Print

Proceedings Paper

Efficient inference algorithms for hybrid dynamic Bayesian networks (HDBN)
Author(s): KuoChu Chang; Hongda Chen
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Bayesian networks for the static as well as for the dynamic cases have been the subject of a great deal of theoretical analysis and practical inference approximations in the research community of artificial intelligence, machine learning and pattern recognition. After exploring the quite well known theory of discrete and continuous Bayesian networks, we introduce an almost instant reasoning scheme to the hybrid Bayesian networks. In addition to illustrate the similarities of the dynamic Bayesian networks (DBN) and the Kalman filter, we present a computationally efficient approach for the inference problem of hybrid dynamic Bayesian networks (HDBN). The proposed method is based on the separations of the dynamic and static nodes, and following hypercubic partitions via the Decision tree algorithm (DT). Experiments show that with high statistical confidence the novel algorithm used in the HDBN performs favorably in the tradeoffs of computational complexities and accuracy performance when compared to Junction tree and Gaussian mixture models on the task of classifications.

Paper Details

Date Published: 9 August 2004
PDF: 8 pages
Proc. SPIE 5429, Signal Processing, Sensor Fusion, and Target Recognition XIII, (9 August 2004); doi: 10.1117/12.544060
Show Author Affiliations
KuoChu Chang, George Mason Univ. (United States)
Hongda Chen, George Mason Univ. (United States)

Published in SPIE Proceedings Vol. 5429:
Signal Processing, Sensor Fusion, and Target Recognition XIII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top