Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models

DOI10.1007/S10618-014-0355-0zbMATH Open1403.68206arXiv1310.1187OpenAlexW2158361602MaRDI QIDQ1711229FDOQ1711229

Authors: Johan Pensar, Henrik Nyman, Timo Koski, Jukka Corander 

Publication date: 17 January 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Abstract: We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such that unrestricted label sets determine which edges can be deleted from the underlying directed acyclic graph (DAG) for a given context. Several properties of these models are derived, including a generalization of the concept of Markov equivalence classes. Efficient Bayesian learning of LDAGs is enabled by introducing an LDAG-based factorization of the Dirichlet prior for the model parameters, such that the marginal likelihood can be calculated analytically. In addition, we develop a novel prior distribution for the model structures that can appropriately penalize a model for its labeling complexity. A non-reversible Markov chain Monte Carlo algorithm combined with a greedy hill climbing approach is used for illustrating the useful properties of LDAG models for both real and synthetic data sets.

Full work available at URL: https://arxiv.org/abs/1310.1187

Recommendations

• A logical approach to context-specific independence
• Labelled Graphical Models
• A Logical Approach to Context-Specific Independence
• A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
• On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs

zbMATH Keywords

Markov chain Monte Carlodirected acyclic graphcontext-specific independencegraphical modelBayesian model learning

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Directed graphs (digraphs), tournaments (05C20) Graphical methods in statistics (62A09)

Cites Work

• A Bayesian method for the induction of probabilistic networks from data
• A characterization of Markov equivalence classes for acyclic digraphs
• Learning Bayesian networks: The combination of knowledge and statistical data
• Large-sample learning of Bayesian networks is NP-hard
• Title not available (Why is that?)
• Probabilistic graphical models.
• Knowledge representation and inference in similarity networks and Bayesian multinets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Labelled Graphical Models
• Statistical Inference in Context Specific Interaction Models for Contingency Tables
• Title not available (Why is that?)
• Bayesian Networks
• Split models for contingency tables
• Bayesian learning of graphical vector autoregressions with unequal lag-lengths

Cited In (9)

• Directed LPA: propagating labels in directed networks
• Decomposable context-specific models
• Context-specific independence in graphical log-linear models
• A logical approach to context-specific independence
• Labelled Graphical Models
• Context-Specific and Local Independence in Markovian Dependence Structures
• Learning discrete decomposable graphical models via constraint optimization
• Context-specific independencies in stratified chain regression graphical models
• The role of local partial independence in learning of Bayesian networks

This page was built for publication: Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711229)