MAP inference in dynamic hybrid Bayesian networks
Ramos-López, Dario; Masegosa, Andres; Martinez, Ana M.; Salmeron, Antonio; Nielsen, Thomas D.; Langseth, Helge; Madsen, Anders L.
Journal article, Peer reviewed
Published version
View/ Open
Date
2017Metadata
Show full item recordCollections
Original version
Progress in Artificial Intelligence. 2017, 6 (2), 133-144. 10.1007/s13748-017-0115-7Abstract
In this paper, we study the maximum a posteriori (MAP) problem in dynamic hybrid Bayesian networks. We are interested in finding the sequence of values of a class variable that maximizes the posterior probability given evidence. We propose an approximate solution based on transforming the MAP problem into a simpler belief update problem. The proposed solution constructs a set of auxiliary networks by grouping consecutive instantiations of the variable of interest, thus capturing some of the potential temporal dependences between these variables while ignoring others. Belief update is carried out independently in the auxiliary models, after which the results are combined, producing a configuration of values for the class variable along the entire time sequence. Experiments have been carried out to analyze the behavior of the approach. The algorithm has been implemented using Java 8 streams, and its scalability has been evaluated.