Timezone: »
We present a novel framework, called GRAB (GRaphical models with overlApping Blocks), to capture densely connected components in a network estimate. GRAB takes as input a data matrix of p variables and n samples, and jointly learns both a network among p variables and densely connected groups of variables (called `blocks'). GRAB has four major novelties as compared to existing network estimation methods: 1) It does not require the blocks to be given a priori. 2) Blocks can overlap. 3) It can jointly learn a network structure and overlapping blocks. 4) It solves a joint optimization problem with the block coordinate descent method that is convex in each step. We show that GRAB reveals the underlying network structure substantially better than four state-of-the-art competitors on synthetic data. When applied to cancer gene expression data, GRAB outperforms its competitors in revealing known functional gene sets and potentially novel genes that drive cancer.
Author Information
Mohammad Javad Hosseini (University of Washington)
Su-In Lee (University of Washington)
More from the Same Authors
-
2020 Poster: Learning Deep Attribution Priors Based On Prior Knowledge »
Ethan Weinberger · Joseph Janizek · Su-In Lee -
2020 Poster: Understanding Global Feature Contributions With Additive Importance Measures »
Ian Covert · Scott Lundberg · Su-In Lee -
2017 Poster: A Unified Approach to Interpreting Model Predictions »
Scott M Lundberg · Su-In Lee -
2017 Oral: A unified approach to interpreting model predictions »
Scott M Lundberg · Su-In Lee -
2014 Workshop: Machine Learning in Computational Biology »
Oliver Stegle · Sara Mostafavi · Anna Goldenberg · Su-In Lee · Michael Leung · Anshul Kundaje · Mark B Gerstein · Martin Renqiang Min · Hannes Bretschneider · Francesco Paolo Casale · Loïc Schwaller · Amit G Deshwar · Benjamin A Logsdon · Yuanyang Zhang · Ali Punjani · Derek C Aguiar · Samuel Kaski