paper-with-me

홈 › Papers

The scalable Birth-Death MCMC Algorithm for Mixed Graphical Model Learning with Application to Genomic Data Integration

2020-05-08 · Nanwei Wang, Laurent Briollais, Helene Massam

Recent advances in biological research have seen the emergence of high-throughput technologies with numerous applications that allow the study of biological mechanisms at an unprecedented depth and scale. A large amount of genomic data is now distributed through consortia like The Cancer Genome Atlas (TCGA), where specific types of biological information on specific type of tissue or cell are available. In cancer research, the challenge is now to perform integrative analyses of high-dimensional multi-omic data with the goal to better understand genomic processes that correlate with cancer outcomes, e.g. elucidate gene networks that discriminate a specific cancer subgroups (cancer sub-typing) or discovering gene networks that overlap across different cancer types (pan-cancer studies). In this paper, we propose a novel mixed graphical model approach to analyze multi-omic data of different types (continuous, discrete and count) and perform model selection by extending the Birth-Death MCMC (BDMCMC) algorithm initially proposed by \citet{stephens2000bayesian} and later developed by \cite{mohammadi2015bayesian}. We compare the performance of our method to the LASSO method and the standard BDMCMC method using simulations and find that our method is superior in terms of both computational efficiency and the accuracy of the model selection results. Finally, an application to the TCGA breast cancer data shows that integrating genomic information at different levels (mutation and expression data) leads to better subtyping of breast cancers.

📄 PDF Abstract BibTeX arXiv:2005.04139

Code (1)

wangnanwei/Birth-death-MCMC-Model-Selection 공식 구현

Tasks

Computational EfficiencyData IntegrationModel Selection

Similar Papers 제목 키워드 기반

Continuous-Time Birth-Death MCMC for Bayesian Regression Tree Models

2019-04-19 · Reza Mohammadi, Matthew Pratola, Maurits Kaptein

Decision trees are flexible models that are well suited for many statistical regression problems. In a Bayesian framework for regression trees, Markov Chain Monte Carlo (MCMC) search algorithms are required to generate s…

regression

Dynamics of advantageous mutant spread in spatial death-birth and birth-death Moran models

2022-09-23 · Jasmine Foo, Einar Bjarki Gunnarsson, Kevin Leder, David Sivakoff

The spread of an advantageous mutation through a population is of fundamental interest in population genetics. While the classical Moran model is formulated for a well-mixed population, it has long been recognized that i…

Bayesian tracking and parameter learning for non-linear multiple target tracking models

2014-10-08 · Lan Jiang, Sumeetpal S. Singh, Sinan Yildirim

We propose a new Bayesian tracking and parameter learning algorithm for non-linear non-Gaussian multiple target tracking (MTT) models. We design a Markov chain Monte Carlo (MCMC) algorithm to sample from the posterior di…

Scalable MCMC for Mixed Membership Stochastic Blockmodels

2015-10-16 · Wenzhe Li, Sungjin Ahn, Max Welling

We propose a stochastic gradient Markov chain Monte Carlo (SG-MCMC) algorithm for scalable inference in mixed-membership stochastic blockmodels (MMSB). Our algorithm is based on the stochastic gradient Riemannian Langevi…

Variational Inference

Evolutionary games on cycles with strong selection

2017-01-23

Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, comp…