Extended graphical lasso for multiple interaction networks for high dimensional omics data

Yang Xu*, Hongmei Jiang, Wenxin Jiang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

There has been a spate of interest in association networks in biological and medical research, for example, genetic interaction networks. In this paper, we propose a novel method, the extended joint hub graphical lasso (EDOHA), to estimate multiple related interaction networks for high dimensional omics data across multiple distinct classes. To be specific, we construct a convex penalized log likelihood optimization problem and solve it with an alternating direction method of multipliers (ADMM) algorithm. The proposed method can also be adapted to estimate interaction networks for high dimensional compositional data such as microbial interaction networks. The performance of the proposed method in the simulated studies shows that EDOHA has remarkable advantages in recognizing class-specific hubs than the existing comparable methods. We also present three applications of real datasets. Biological interpretations of our results confirm those of previous studies and offer a more comprehensive understanding of the underlying mechanism in disease.

Original languageEnglish (US)
Article numbere1008794
JournalPLoS computational biology
Volume17
Issue number10 October
DOIs
StatePublished - Oct 2021

ASJC Scopus subject areas

  • Ecology, Evolution, Behavior and Systematics
  • Modeling and Simulation
  • Ecology
  • Molecular Biology
  • Genetics
  • Cellular and Molecular Neuroscience
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Extended graphical lasso for multiple interaction networks for high dimensional omics data'. Together they form a unique fingerprint.

Cite this