Learning Bayesian Networks from Markov Random Fields: An Efficient Algorithm for Linear Models
Publication in refereed journal


摘要Dependency analysis is a typical approach for Bayesian network learning, which infers the structures of Bayesian networks by the results of a series of conditional independence (CI) tests. In practice, testing independence conditioning on large sets hampers the performance of dependency analysis algorithms in terms of accuracy and running time for the following reasons. First, testing independence on large sets of variables with limited samples is not stable. Second, for most dependency analysis algorithms, the number of CI tests grows at an exponential rate with the sizes of conditioning sets, and the running time grows of the same rate. Therefore, determining how to reduce the number of CI tests and the sizes of conditioning sets becomes a critical step in dependency analysis algorithms. In this article, we address a two-phase algorithm based on the observation that the structures of Markov random fields are similar to those of Bayesian networks. The first phase of the algorithm constructs a Markov random field from data, which provides a close approximation to the structure of the true Bayesian network; the second phase of the algorithm removes redundant edges according to CI tests to get the true Bayesian network. Both phases use Markov blanket information to reduce the sizes of conditioning sets and the number of CI tests without sacrificing accuracy. An empirical study shows that the two-phase algorithm performs well in terms of accuracy and efficiency.
著者Wang ZX, Chan LW
期刊名稱ACM Transactions on Knowledge Discovery from Data
關鍵詞Bayesian networks; causal modeling; graphical models
Web of Science 學科類別Computer Science; Computer Science, Information Systems; COMPUTER SCIENCE, INFORMATION SYSTEMS; Computer Science, Software Engineering; COMPUTER SCIENCE, SOFTWARE ENGINEERING

上次更新時間 2020-21-10 於 00:47