Two Bayesian Approaches to Dynamic Gaussian Bayesian Networks with Intra- and Inter-Slice Edges
By: Kezhuo Li, Marco Grzegorczyk
Potential Business Impact:
Finds hidden patterns in changing data.
Gaussian Dynamic Bayesian Networks (GDBNs) are a widely used tool for learning network structures from continuous time-series data. To capture both time-lagged and contemporaneous dependencies, advanced GDBNs allow for dynamic inter-slice edges as well as static intra-slice edges. In the literature, two Bayesian modeling approaches have been developed for GDBNs. Both build on and extend the well-known Gaussian BGe score. We refer to them as the mean-adjusted BGe (mBGe) and the extended BGe (eBGe) models. In this paper, we contrast the two models and compare their performance empirically. The main finding of our study is that the two models induce different equivalence classes of network structures. In particular, the equivalence classes implied by the eBGe model are non-standard, and we propose a new variant of the DAG-to-CPDAG algorithm to identify them. To the best of our knowledge, these non-standard equivalence classes have not been previously reported.
Similar Papers
Bayesian computation for high-dimensional Gaussian Graphical Models with spike-and-slab priors
Methodology
Find hidden connections in lots of data faster.
PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification
Machine Learning (CS)
Helps computers learn from changing online connections.
Discrete Bayesian Sample Inference for Graph Generation
Machine Learning (CS)
Creates new molecules and data structures faster.