Gaussian Bayesian network comparisons with graph ordering unknown
Abstract
A Bayesian approach is proposed that unifies Gaussian Bayesian network constructions and comparisons between two networks (identical or differential) for data with graph ordering unknown. When sampling graph ordering, to escape from local maximums, an adjusted single queue equi-energy algorithm is applied. The conditional posterior probability mass function for network differentiation is derived and its asymptotic proposition is theoretically assessed. Simulations are used to demonstrate the approach and compare with existing methods. Based on epigenetic data at a set of DNA methylation sites (CpG sites), the proposed approach is further examined on its ability to detect network differentiations. Findings from theoretical assessment, simulations, and real data applications support the efficacy and efficiency of the proposed method for network comparisons.
Publication Title
Computational Statistics and Data Analysis
Recommended Citation
Zhang, H., Huang, X., Han, S., Rezwan, F., Karmaus, W., Arshad, H., & Holloway, J. (2021). Gaussian Bayesian network comparisons with graph ordering unknown. Computational Statistics and Data Analysis, 157 https://doi.org/10.1016/j.csda.2020.107156
