Browse
Submit Data
Databases
API
Help

Dataset Information

22 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Bayesian Joint Spike-and-Slab Graphical Lasso.

ABSTRACT: In this article, we propose a new class of priors for Bayesian inference with multiple Gaussian graphical models. We introduce Bayesian treatments of two popular procedures, the group graphical lasso and the fused graphical lasso, and extend them to a continuous spike-and-slab framework to allow self-adaptive shrinkage and model selection simultaneously. We develop an EM algorithm that performs fast and dynamic explorations of posterior modes. Our approach selects sparse models efficiently and automatically with substantially smaller bias than would be induced by alternative regularization procedures. The performance of the proposed methods are demonstrated through simulation and two real data examples.

SUBMITTER: Richard Li Z

PROVIDER: S-EPMC7845917 | biostudies-literature | 2019 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Bayesian Joint Spike-and-Slab Graphical Lasso.

Richard Li Zehang Z McCormick Tyler H TH Clark Samuel J SJ

Proceedings of machine learning research 20190601

In this article, we propose a new class of priors for Bayesian inference with multiple Gaussian graphical models. We introduce Bayesian treatments of two popular procedures, the group graphical lasso and the fused graphical lasso, and extend them to a continuous spike-and-slab framework to allow self-adaptive shrinkage and model selection simultaneously. We develop an EM algorithm that performs fast and dynamic explorations of posterior modes. Our approach selects sparse models efficiently and a ...[more]

PMID: 33521648

Similar Datasets

Analysis of Twitter data with the Bayesian fused graphical lasso.

Project description:We propose a method to simplify textual Twitter data into understandable networks of terms that can signify important events and their possible changes over time. The method allows for common characteristics of the networks across time periods and each period can comprise multiple unknown sub-networks. The networks are described by Gaussian graphical models and their parameter values are estimated through a Bayesian approach with a fused lasso-type prior on the precision matrices of the underlying mixtures of the sub-models. A flexible data allocation scheme is at the heart of an MCMC algorithm to recover mean and covariance parameters of the mixture components. Several implementations of the outlined estimation procedure are studied and compared based on simulated data. The procedure with the highest predictive power is used for mining tweets regarding the 2009 Iranian presidential election.

| S-EPMC7384635 | biostudies-literature

Importance-Penalized Joint Graphical Lasso (IPJGL): differential network inference via GGMs.

Project description:MotivationDifferential network inference is a fundamental and challenging problem to reveal gene interactions and regulation relationships under different conditions. Many algorithms have been developed for this problem; however, they do not consider the differences between the importance of genes, which may not fit the real-world situation. Different genes have different mutation probabilities, and the vital genes associated with basic life activities have less fault tolerance to mutation. Equally treating all genes may bias the results of differential network inference. Thus, it is necessary to consider the importance of genes in the models of differential network inference.ResultsBased on the Gaussian graphical model with adaptive gene importance regularization, we develop a novel importance-penalized joint graphical Lasso method, IPJGL, for differential network inference. The presented method is validated by the simulation experiments as well as the real datasets. Furthermore, to precisely evaluate the results of differential network inference, we propose a new metric named APC2 for the differential levels of gene pairs. We apply IPJGL to analyze the TCGA colorectal and breast cancer datasets and find some candidate cancer genes with significant survival analysis results, including SOST for colorectal cancer and RBBP8 for breast cancer. We also conduct further analysis based on the interactions in the Reactome database and confirm the utility of our method.AvailabilityR source code of importance-penalized joint graphical lasso is freely available at https://github.com/Wu-Lab/IPJGL.Supplementary informationSupplementary materials are available at Bioinformatics online.

| S-EPMC8756181 | biostudies-literature

The joint graphical lasso for inverse covariance estimation across multiple classes.

Project description:We consider the problem of estimating multiple related Gaussian graphical models from a high-dimensional data set with observations belonging to distinct classes. We propose the joint graphical lasso, which borrows strength across the classes in order to estimate multiple graphical models that share certain characteristics, such as the locations or weights of nonzero edges. Our approach is based upon maximizing a penalized log likelihood. We employ generalized fused lasso or group lasso penalties, and implement a fast ADMM algorithm to solve the corresponding convex optimization problems. The performance of the proposed method is illustrated through simulated and real data examples.

| S-EPMC4012833 | biostudies-literature

The spike-and-slab lasso Cox model for survival prediction and associated genes detection.

Project description:MotivationLarge-scale molecular profiling data have offered extraordinary opportunities to improve survival prediction of cancers and other diseases and to detect disease associated genes. However, there are considerable challenges in analyzing large-scale molecular data.ResultsWe propose new Bayesian hierarchical Cox proportional hazards models, called the spike-and-slab lasso Cox, for predicting survival outcomes and detecting associated genes. We also develop an efficient algorithm to fit the proposed models by incorporating Expectation-Maximization steps into the extremely fast cyclic coordinate descent algorithm. The performance of the proposed method is assessed via extensive simulations and compared with the lasso Cox regression. We demonstrate the proposed procedure on two cancer datasets with censored survival outcomes and thousands of molecular features. Our analyses suggest that the proposed procedure can generate powerful prognostic models for predicting cancer survival and can detect associated genes.Availability and implementationThe methods have been implemented in a freely available R package BhGLM ( http://www.ssg.uab.edu/bhglm/ ).Contactnyi@uab.edu.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC5870779 | biostudies-literature

Weighted Fused Pathway Graphical Lasso for Joint Estimation of Multiple Gene Networks.

Project description:Gene regulatory networks (GRNs) are often inferred based on Gaussian graphical models that could identify the conditional dependence among genes by estimating the corresponding precision matrix. Classical Gaussian graphical models are usually designed for single network estimation and ignore existing knowledge such as pathway information. Therefore, they can neither make use of the common information shared by multiple networks, nor can they utilize useful prior information to guide the estimation. In this paper, we propose a new weighted fused pathway graphical lasso (WFPGL) to jointly estimate multiple networks by incorporating prior knowledge derived from known pathways and gene interactions. Based on the assumption that two genes are less likely to be connected if they do not participate together in any pathways, a pathway-based constraint is considered in our model. Moreover, we introduce a weighted fused lasso penalty in our model to take into account prior gene interaction data and common information shared by multiple networks. Our model is optimized based on the alternating direction method of multipliers (ADMM). Experiments on synthetic data demonstrate that our method outperforms other five state-of-the-art graphical models. We then apply our model to two real datasets. Hub genes in our identified state-specific networks show some shared and specific patterns, which indicates the efficiency of our model in revealing the underlying mechanisms of complex diseases.

| S-EPMC6662592 | biostudies-literature

Development and Validation of a Radiosensitivity Prediction Model for Lower Grade Glioma Based on Spike-and-Slab Lasso.

Project description:Background and purposeLower grade glioma (LGG) is one of the leading causes of death world worldwide. We attempted to develop and validate a radiosensitivity model for predicting the survival of lower grade glioma by using spike-and-slab lasso Cox model.MethodsIn this research, differentially expressed genes based on tumor microenvironment was obtained to further analysis. Log-rank test was used to identify genes in patients who received radiotherapy and patients who did not receive radiotherapy, respectively. Then, spike-and-slab lasso was performed to select genes in patients who received radiotherapy. Finally, three genes (INA, LEPREL1 and PTCRA) were included in the model. A radiosensitivity-related risk score model was established based on overall rate of TCGA dataset in patients who received radiotherapy. The model was validated in TCGA dataset that PFS as endpoint and two CGGA datasets that OS as endpoint. A novel nomogram integrated risk score with age and tumor grade was developed to predict the OS of LGG patients.ResultsWe developed and verified a radiosensitivity-related risk score model. The radiosensitivity-related risk score is served as an independent prognostic indicator. This radiosensitivity-related risk score model has prognostic prediction ability. Moreover, the nomogram integrated risk score with age and tumor grade was established to perform better for predicting 1, 3, 5-year survival rate.ConclusionsThis model can be used by clinicians and researchers to predict patient's survival rates and achieve personalized treatment of LGG.

| S-EPMC8363254 | biostudies-literature

A non-negative spike-and-slab lasso generalized linear stacking prediction modeling method for high-dimensional omics data

Project description: Not available

| S-EPMC10953151 | biostudies-literature

Group spike-and-slab lasso generalized linear models for disease prediction and associated genes detection by incorporating pathway information.

Project description:MotivationLarge-scale molecular data have been increasingly used as an important resource for prognostic prediction of diseases and detection of associated genes. However, standard approaches for omics data analysis ignore the group structure among genes encoded in functional relationships or pathway information.ResultsWe propose new Bayesian hierarchical generalized linear models, called group spike-and-slab lasso GLMs, for predicting disease outcomes and detecting associated genes by incorporating large-scale molecular data and group structures. The proposed model employs a mixture double-exponential prior for coefficients that induces self-adaptive shrinkage amount on different coefficients. The group information is incorporated into the model by setting group-specific parameters. We have developed a fast and stable deterministic algorithm to fit the proposed hierarchal GLMs, which can perform variable selection within groups. We assess the performance of the proposed method on several simulated scenarios, by varying the overlap among groups, group size, number of non-null groups, and the correlation within group. Compared with existing methods, the proposed method provides not only more accurate estimates of the parameters but also better prediction. We further demonstrate the application of the proposed procedure on three cancer datasets by utilizing pathway structures of genes. Our results show that the proposed method generates powerful models for predicting disease outcomes and detecting associated genes.Availability and implementationThe methods have been implemented in a freely available R package BhGLM (http://www.ssg.uab.edu/bhglm/).Contactnyi@uab.edu.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC5860634 | biostudies-literature

The cluster graphical lasso for improved estimation of Gaussian graphical models.

Project description:The task of estimating a Gaussian graphical model in the high-dimensional setting is considered. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to a lasso penalty, is a well-studied approach for this task. A surprising connection between the graphical lasso and hierarchical clustering is introduced: the graphical lasso in effect performs a two-step procedure, in which (1) single linkage hierarchical clustering is performed on the variables in order to identify connected components, and then (2) a penalized log likelihood is maximized on the subset of variables within each connected component. Thus, the graphical lasso determines the connected components of the estimated network via single linkage clustering. The single linkage clustering is known to perform poorly in certain finite-sample settings. Therefore, the cluster graphical lasso, which involves clustering the features using an alternative to single linkage clustering, and then performing the graphical lasso on the subset of variables within each cluster, is proposed. Model selection consistency for this technique is established, and its improved performance relative to the graphical lasso is demonstrated in a simulation study, as well as in applications to a university webpage and a gene expression data sets.

| S-EPMC4307846 | biostudies-literature

Bayesian Graphical Regression.

Project description:We consider the problem of modeling conditional independence structures in heterogeneous data in the presence of additional subject-level covariates - termed Graphical Regression. We propose a novel specification of a conditional (in)dependence function of covariates - which allows the structure of a directed graph to vary flexibly with the covariates; imposes sparsity in both edge and covariate selection; produces both subject-specific and predictive graphs; and is computationally tractable. We provide theoretical justifications of our modeling endeavor, in terms of graphical model selection consistency. We demonstrate the performance of our method through rigorous simulation studies. We illustrate our approach in a cancer genomics-based precision medicine paradigm, where-in we explore gene regulatory networks in multiple myeloma taking prognostic clinical factors into account to obtain both population-level and subject-level gene regulatory networks.

| S-EPMC10021014 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data