Graphical models are a powerful tool for visually representing conditional independence structures of a set of variables. Recently, multiple graphical models for Gaussian variables have been extensively studied to analyse data coming from sub- groups or subpopulations. However, proposals for binary sampling models remain limited. Here we present a methodological framework for Bayesian inference and model selection in multiple Ising models.We aim to model the variability introduced into a collection of binary variables due to external factors. The proposed Bayesian approach leverages conjugate priors and Laplace approximations, facilitating effi- cient model selection through a Metropolis-Hastings algorithm. Our methodological contributions are learning subgroup network structures for both model selection and parameter inference.We compare the performance of our proposed Bayesian method and other competing approaches, and show that our proposed method has a good performance in identifying related groups while offering balanced network sparsity and edge selection.

A Bayesian Multiple Ising Model / Alejandra Avalos Pacheco, Andrea Lazzerini, Monia Lupparelli, Francesco Claudio Stingo. - STAMPA. - (In corso di stampa), pp. 1-8.

A Bayesian Multiple Ising Model

Monia Lupparelli;Francesco Claudio Stingo
In corso di stampa

Abstract

Graphical models are a powerful tool for visually representing conditional independence structures of a set of variables. Recently, multiple graphical models for Gaussian variables have been extensively studied to analyse data coming from sub- groups or subpopulations. However, proposals for binary sampling models remain limited. Here we present a methodological framework for Bayesian inference and model selection in multiple Ising models.We aim to model the variability introduced into a collection of binary variables due to external factors. The proposed Bayesian approach leverages conjugate priors and Laplace approximations, facilitating effi- cient model selection through a Metropolis-Hastings algorithm. Our methodological contributions are learning subgroup network structures for both model selection and parameter inference.We compare the performance of our proposed Bayesian method and other competing approaches, and show that our proposed method has a good performance in identifying related groups while offering balanced network sparsity and edge selection.
In corso di stampa
Proceedings of Bayesian Young Statisticians Meeting
1
8
Alejandra Avalos Pacheco, Andrea Lazzerini, Monia Lupparelli, Francesco Claudio Stingo
File in questo prodotto:
File Dimensione Formato  
Avalos Pacheco et al 2024 BAYSM2024.pdf

Accesso chiuso

Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 156.55 kB
Formato Adobe PDF
156.55 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1387713
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact