Abstract
A Bayesian network consists of a directed acyclic graph (DAG) and a set of conditional probability distributions (CPDs); they together define a joint probability distribution (jpd). The structure of the DAG dictates how a jpd can be factorized as a product of CPDs. This CPD factorization view of Bayesian networks has been well recognized and studied in the uncertainty community. In this article, we take a different perspective by studying a marginal factorization view of Bayesian networks. In particular, we propose an algebraic characterization of equivalent DAGs based on the marginal factorization of a jpd defined by a Bayesian network. Moreover, we show a simple method to identify all the compelled edges in a DAG. © 2004 Wiley Periodicals, Inc. Int J Int Syst 19: 769–786, 2004.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
