A Transformational Characterization of Equivalent Bayesian Network Structures

Abstract

We present a simple characterization of equivalent Bayesian network structures based on local transformations. The significance of the characterization is twofold. First, we are able to easily prove several new invariant properties of theoretical interest for equivalent structures. Second, we use the characterization to derive an efficient algorithm that identifies all of the compelled edges in a structure. Compelled edge identification is of particular importance for learning Bayesian network structures from data because these edges indicate causal relationships when certain assumptions hold.

Appears in Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI1995)

References in corpus (1)

• Causal Inference and Causal Explanation with Background Knowledge

Cited by in corpus (42)

• A simple approach for finding the globally optimal Bayesian network structure
• Data Analysis with Bayesian Networks: A Bootstrap Approach
• Identifiability of Gaussian structural equation models with equal error variances
• Causal Discovery with Continuous Additive Noise Models
• Large-Sample Learning of Bayesian Networks is NP-Hard
• Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
• Learning Bayesian Networks: A Unification for Discrete and Gaussian Domains
• Finding Optimal Bayesian Networks
• Parameter Priors for Directed Acyclic Graphical Models and the Characterization of Several Probability Distributions
• Learning Bayesian Networks with the bnlearn R Package
• High-dimensional learning of linear causal networks via inverse covariance estimation
• Enumerating Markov Equivalence Classes of Acyclic Digraph Models
• Parameterized Complexity Results for Exact Bayesian Network Structure Learning
• Permutation-based Causal Inference Algorithms with Interventions
• Learning Bayesian Network Equivalence Classes with Ant Colony Optimization
• On Local Optima in Learning Bayesian Networks
• Improved learning of Bayesian networks
• Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
• Structural Markov graph laws for Bayesian model uncertainty
• Parameter Priors for Directed Acyclic Graphical Models and the Characterization of Several Probability Distributions
• On the Use of Skeletons when Learning in Bayesian Networks
• Causal datasheet: An approximate guide to practically assess Bayesian networks in the real world
• On characterizing Inclusion of Bayesian Networks
• An Empirical-Bayes Score for Discrete Bayesian Networks
• Ordering-Based Causal Structure Learning in the Presence of Latent Variables
• Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Game
• Evaluating structure learning algorithms with a balanced scoring function
• Algorithms and Complexity Results for Exact Bayesian Structure Learning
• Learning DAGs without imposing acyclicity
• Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
• Towards Scalable Bayesian Learning of Causal DAGs
• The FEDHC Bayesian network learning algorithm
• A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent Variables
• Beyond Uniform Priors in Bayesian Network Structure Learning
• Supplement to "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs"
• A Hybrid Anytime Algorithm for the Constructiion of Causal Models From Sparse Data
• Generalized Permutohedra from Probabilistic Graphical Models
• Towards Characterising Bayesian Network Models under Selection
• On Finding Optimal Polytrees
• On Identifying Significant Edges in Graphical Models of Molecular Networks
• Finding Consensus Bayesian Network Structures
• On the Semi-Markov Equivalence of Causal Models