A Markov equivalence class contains all the Directed Acyclic Graphs (DAGs) encoding the same conditional independencies, and is represented by a Completed Partially Directed Acyclic Graph (CPDAG), also named Essential Graph (EG).We approach the problem of model selection among noncausal sparse Gaussian DAGs by directly scoring EGs, using an objective Bayes method. Specifically, we construct objective priors for model selection based on the Fractional Bayes Factor, leading to a closed form expression for the marginal likelihood of an EG. Next we propose an MCMC strategy to explore the space of EGs using sparsity constraints, and illustrate the performance of our method on simulation studies, as well as on a real dataset. Our method provides a coherent quantication of inferential uncertainty, requires minimal prior specication, and shows to be competitive in learning the structure of the data-generating EG when compared to alternative state-of-the-art algorithms.

(2018). Learning Markov Equivalence Classes of Directed Acyclic Graphs: an Objective Bayes Approach [journal article - articolo]. In BAYESIAN ANALYSIS. Retrieved from http://hdl.handle.net/10446/202735

Learning Markov Equivalence Classes of Directed Acyclic Graphs: an Objective Bayes Approach

Marco Della Vedova;
2018-01-01

Abstract

A Markov equivalence class contains all the Directed Acyclic Graphs (DAGs) encoding the same conditional independencies, and is represented by a Completed Partially Directed Acyclic Graph (CPDAG), also named Essential Graph (EG).We approach the problem of model selection among noncausal sparse Gaussian DAGs by directly scoring EGs, using an objective Bayes method. Specifically, we construct objective priors for model selection based on the Fractional Bayes Factor, leading to a closed form expression for the marginal likelihood of an EG. Next we propose an MCMC strategy to explore the space of EGs using sparsity constraints, and illustrate the performance of our method on simulation studies, as well as on a real dataset. Our method provides a coherent quantication of inferential uncertainty, requires minimal prior specication, and shows to be competitive in learning the structure of the data-generating EG when compared to alternative state-of-the-art algorithms.
articolo
2018
Castelletti, Federico; Consonni, Guido; DELLA VEDOVA, Marco Luigi; Peluso, Stefano
(2018). Learning Markov Equivalence Classes of Directed Acyclic Graphs: an Objective Bayes Approach [journal article - articolo]. In BAYESIAN ANALYSIS. Retrieved from http://hdl.handle.net/10446/202735
File allegato/i alla scheda:
File Dimensione del file Formato  
2018_bayesian.pdf

accesso aperto

Versione: publisher's version - versione editoriale
Licenza: Creative commons
Dimensione del file 679.93 kB
Formato Adobe PDF
679.93 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/202735
Citazioni
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 21
social impact