Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
DOI10.1007/s10618-014-0355-0zbMath1403.68206arXiv1310.1187OpenAlexW2158361602MaRDI QIDQ1711229
Johan Pensar, Timo Koski, Henrik Nyman, Jukka Corander
Publication date: 17 January 2019
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.1187
Markov chain Monte Carlodirected acyclic graphgraphical modelBayesian model learningcontext-specific independence
Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Directed graphs (digraphs), tournaments (05C20) Graphical methods in statistics (62A09)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Split models for contingency tables
- Bayesian learning of graphical vector autoregressions with unequal lag-lengths
- 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
- Knowledge representation and inference in similarity networks and Bayesian multinets
- Labelled Graphical Models
- Statistical Inference in Context Specific Interaction Models for Contingency Tables
- Bayesian Networks
This page was built for publication: Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models