title: Empirical evaluation of scoring functions for Bayesian network model selection.
abstract: In this work, we empirically evaluate the capability of various scoring functions of Bayesian networks for recovering true underlying structures. Similar investigations have been carried out before, but they typically relied on approximate learning algorithms to learn the network structures. The suboptimal structures found by the approximation methods have unknown quality and may affect the reliability of their conclusions. Our study uses an optimal algorithm to learn Bayesian network structures from datasets generated from a set of gold standard Bayesian networks. Because all optimal algorithms always learn equivalent networks, this ensures that only the choice of scoring function affects the learned networks. Another shortcoming of the previous studies stems from their use of random synthetic networks as test cases. There is no guarantee that these networks reflect real-world data. We use real-world data to generate our gold-standard structures, so our experimental design more closely approximates real-world situations. A major finding of our study suggests that, in contrast to results reported by several prior works, the Minimum Description Length (MDL) (or equivalently, Bayesian information criterion (BIC)) consistently outperforms other scoring functions such as Akaike's information criterion (AIC), Bayesian Dirichlet equivalence score (BDeu), and factorized normalized maximum likelihood (fNML) in recovering the underlying Bayesian network structures. We believe this finding is a result of using both datasets generated from real-world applications rather than from random processes used in previous studies and learning algorithms to select high-scoring structures rather than selecting random models. Other findings of our study support existing work, e.g., large sample sizes result in learning structures closer to the true underlying structure; the BDeu score is sensitive to the parameter settings; and the fNML performs pretty well on small datasets. We also tested a greedy hill climbing algorithm and observed similar results as the optimal algorithm.
authors.affiliation: Department of Computer Science and Engineering, Mississippi State University, Mississippi State, MS 39762, USA.
authors.forename: Zhifa
authors.initials: Z
authors.lastname: Liu
authors.forename: Brandon
authors.initials: B
authors.lastname: Malone
authors.forename: Changhe
authors.initials: C
authors.lastname: Yuan
mesh_terms: D000465:Algorithms; D001499:Bayes Theorem; D019295:Computational Biology / Q000379:methods; D016013:Likelihood Functions; D015233:Models, Statistical; D015203:Reproducibility of Results; D018401:Sample Size