Node-based learning of multiple Gaussian graphical models
From MaRDI portal
Abstract: We consider the problem of estimating high-dimensional Gaussian graphical models corresponding to a single set of variables under several distinct conditions. This problem is motivated by the task of recovering transcriptional regulatory networks on the basis of gene expression data {containing heterogeneous samples, such as different disease states, multiple species, or different developmental stages}. We assume that most aspects of the conditional dependence networks are shared, but that there are some structured differences between them. Rather than assuming that similarities and differences between networks are driven by individual edges, we take a node-based approach, which in many cases provides a more intuitive interpretation of the network differences. We consider estimation under two distinct assumptions: (1) differences between the K networks are due to individual nodes that are perturbed across conditions, or (2) similarities among the K networks are due to the presence of common hub nodes that are shared across all K networks. Using a row-column overlap norm penalty function, we formulate two convex optimization problems that correspond to these two assumptions. We solve these problems using an alternating direction method of multipliers algorithm, and we derive a set of necessary and sufficient conditions that allows us to decompose the problem into independent subproblems so that our algorithm can be scaled to high-dimensional settings. Our proposal is illustrated on synthetic data, a webpage data set, and a brain cancer gene expression data set.
Recommendations
Cited in
(38)- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Testing the differential network between two gaussian graphical models with false discovery rate control
- Joint Gaussian graphical model estimation: a survey
- Bayesian learning of multiple directed networks from observational data
- Node-structured integrative Gaussian graphical model guided by pathway information
- Reconstruction of molecular network evolution from cross-sectional omics data
- Learning of Tree-Structured Gaussian Graphical Models on Distributed Data Under Communication Constraints
- Structural pursuit over multiple undirected graphs
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- High-dimensional joint estimation of multiple directed Gaussian graphical models
- Estimating sparse networks with hubs
- Direct estimation of differential networks
- A random covariance model for bi‐level graphical modeling with application to resting‐state fMRI data
- Heterogeneous reciprocal graphical models
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- Multilevel Gaussian graphical model for multilevel networks
- Learning a common substructure of multiple graphical Gaussian models
- On semiparametric exponential family graphical models
- A modified Peaceman-Rachford splitting method with correction steps for three-block convex problem
- Hub Detection in Gaussian Graphical Models
- Group-wise shrinkage estimation in penalized model-based clustering
- Model-based clustering with sparse covariance matrices
- Multivariate Gaussian network structure learning
- Post-regularization inference for time-varying nonparanormal graphical models
- Bayesian graphical models for differential pathways
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- Learning graphical models with hubs
- Joint estimation of heterogeneous exponential Markov random fields through an approximate likelihood inference
- Estimation of multiple networks in Gaussian mixture models
- Rejoinder to the discussion of ``Bayesian graphical models for modern biological applications
- Penalized composite likelihood for colored graphical Gaussian models
- Inferring hub nodes on differential Gaussian graphical models
- A constrained \(\ell1\) minimization approach for estimating multiple sparse Gaussian or nonparanormal graphical models
- Propagation on multi-relational graphs for node regression
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- Assisted graphical model for gene expression data analysis
- A unified framework for structured graph learning via spectral constraints
This page was built for publication: Node-based learning of multiple Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933996)
