MoReL: Multi-omics Relational Learning
Not on the map. Why?
Abstract (arXiv)
Multi-omics data analysis has the potential to discover hidden molecular interactions, revealing potential regulatory and/or signal transduction pathways for cellular processes of interest when studying life and disease systems. One of critical challenges when dealing with real-world multi-omics data is that they may manifest heterogeneous structures and data quality as often existing data may be collected from different subjects under different conditions for each type of omics data. We propose a novel deep Bayesian generative model to efficiently infer a multi-partite graph encoding molecular interactions across such heterogeneous views, using a fused Gromov-Wasserstein (FGW) regularization between latent representations of corresponding views for integrative analysis. With such an optimal transport regularization in the deep Bayesian generative model, it not only allows incorporating view-specific side information, either with graph-structured or unstructured data in different views, but also increases the model flexibility with the distribution-based regularization. This allows efficient alignment of heterogeneous latent variable distributions to derive reliable interaction predictions compared to the existing point-based graph embedding methods. Our experiments on several real-world datasets demonstrate enhanced performance of MoReL in inferring meaningful interactions compared to existing baselines.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 15 Mar 2022.
Builds on
22 of 41 references.
References · 22
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2017Concrete Dropoutcited by 227
- 2018Optimal Transport for structured data with application on graphscited by 170
- 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 125
- 2018Gromov-Wasserstein Alignment of Word Embedding Spacescited by 119
- 2020Graph Optimal Transport for Cross-Domain Alignmentcited by 103
- 2019Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matchingcited by 102
- 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
10 more
- 2017Geometric Matrix Completion with Recurrent Multi-Graph Neural Networkscited by 88
- 2019Variational Graph Recurrent Neural Networkscited by 86
- 2020Bayesian Graph Neural Networks with Adaptive Connection Samplingcited by 81
- 2019Sliced Gromov-Wassersteincited by 66
- 2019Semi-Implicit Graph Variational Auto-Encoderscited by 54
- 2019Learning Generative Models across Incomparable Spacescited by 53
- 2014Matrix Completion on Graphscited by 26
- 2020Learning Autoencoders with Relational Regularizationcited by 20
- 2018Canonical Correlation Analysis of Datasets with a Common Source Graphcited by 3
- 2020BayReL: Bayesian Relational Learning for Multi-omics Data Integrationcited by 2
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.