\textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models

DOI10.1007/S00180-017-0719-1MaRDI QIDQ2358944zbMATH OpenOpenAlexFDO

Authors Sagnik Datta, Eric Leclerc, Frédéric Y. Bois, Ghislaine Gayraud

Publication date 27 June 2017

Published in Computational Statistics (Search for Journal in Brave)

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

zbMATH Keywords

MCMCBayesian networksstructure learningposterior distributionMetropolis-Hasting algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Abstract: Bayesian networks (BNs) are widely used graphical models usable to draw statistical inference about Directed acyclic graphs (DAGs). We presented here Graph_sampler a fast free C language software for structural inference on BNs. Graph_sampler uses a fully Bayesian approach in which the marginal likelihood of the data and prior information about the network structure are considered. This new software can handle both the continuous as well discrete data and based on the data type two different models are formulated. The software also provides a wide variety of structure priors which can be informative or uninformative. We proposed a new and much faster jumping kernel strategy in the Metropolis-Hastings algorithm. The source C code distributed is very compact, fast, uses low memory and disk storage. We performed out several analyses based on different simulated data sets and synthetic as well as real networks to discuss the performance of Graph_sampler.

Recommendations

• A Gibbs sampler for learning DAGs
• Structure learning in Bayesian networks of a moderate size by efficient sampling
• Structure discovery in Bayesian networks by sampling partial orders
• Markov chain Monte Carlo model selection for DAG models
• Bayesian networks. With examples in R

Cites work

• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2173816 (Why is no real title available?)
• scientific article; zbMATH DE number 2117879 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• A dynamic topological sort algorithm for directed acyclic graphs
• Inference from iterative simulation using multiple sequences
• Introduction to Graphical Modelling
• Learning Bayesian networks: The combination of knowledge and statistical data

Cited in

(1)

• Graph_sampler

Describes a project that uses

Uses Software

• Blaise
• MIM
• VIBES
• bnlearn
• bnsoft
• HUGIN
• deal
• R

This page was built for publication: \textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models

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