A Multimodal Graph Neural Network Framework of Cancer Molecular Subtype
Classification
- URL: http://arxiv.org/abs/2302.12838v2
- Date: Wed, 24 Jan 2024 00:39:57 GMT
- Title: A Multimodal Graph Neural Network Framework of Cancer Molecular Subtype
Classification
- Authors: Bingjun Li, Sheida Nabavi
- Abstract summary: We propose a novel end-to-end multi-omics GNN framework for accurate and robust cancer subtype classification.
We test the proposed model on TCGA Pan-cancer dataset and TCGA breast cancer dataset for molecular subtype and cancer subtype classification.
- Score: 0.27195102129094995
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The recent development of high-throughput sequencing creates a large
collection of multi-omics data, which enables researchers to better investigate
cancer molecular profiles and cancer taxonomy based on molecular subtypes.
Integrating multi-omics data has been proven to be effective for building more
precise classification models. Current multi-omics integrative models mainly
use early fusion by concatenation or late fusion based on deep neural networks.
Due to the nature of biological systems, graphs are a better representation of
bio-medical data. Although few graph neural network (GNN) based multi-omics
integrative methods have been proposed, they suffer from three common
disadvantages. One is most of them use only one type of connection, either
inter-omics or intra-omic connection; second, they only consider one kind of
GNN layer, either graph convolution network (GCN) or graph attention network
(GAT); and third, most of these methods lack testing on a more complex cancer
classification task. We propose a novel end-to-end multi-omics GNN framework
for accurate and robust cancer subtype classification. The proposed model
utilizes multi-omics data in the form of heterogeneous multi-layer graphs that
combines both inter-omics and intra-omic connections from established
biological knowledge. The proposed model incorporates learned graph features
and global genome features for accurate classification. We test the proposed
model on TCGA Pan-cancer dataset and TCGA breast cancer dataset for molecular
subtype and cancer subtype classification, respectively. The proposed model
outperforms four current state-of-the-art baseline models in multiple
evaluation metrics. The comparative analysis of GAT-based models and GCN-based
models reveals that GAT-based models are preferred for smaller graphs with less
information and GCN-based models are preferred for larger graphs with extra
information.
Related papers
- Comparative Analysis of Multi-Omics Integration Using Advanced Graph Neural Networks for Cancer Classification [40.45049709820343]
Multi-omics data integration poses significant challenges due to the high dimensionality, data complexity, and distinct characteristics of various omics types.
This study evaluates three graph neural network architectures for multi-omics (MO) integration based on graph-convolutional networks (GCN), graph-attention networks (GAT), and graph-transformer networks (GTN)
arXiv Detail & Related papers (2024-10-05T16:17:44Z) - Heterogeneous graph attention network improves cancer multiomics integration [8.729516996214537]
We introduce a Heterogeneous Graph ATtention network for omics integration (HeteroGATomics) to improve cancer diagnosis.
Experiments on three cancer multiomics datasets demonstrate HeteroGATomics' superior performance in cancer diagnosis.
arXiv Detail & Related papers (2024-08-05T22:01:13Z) - Generation is better than Modification: Combating High Class Homophily Variance in Graph Anomaly Detection [51.11833609431406]
Homophily distribution differences between different classes are significantly greater than those in homophilic and heterophilic graphs.
We introduce a new metric called Class Homophily Variance, which quantitatively describes this phenomenon.
To mitigate its impact, we propose a novel GNN model named Homophily Edge Generation Graph Neural Network (HedGe)
arXiv Detail & Related papers (2024-03-15T14:26:53Z) - Tertiary Lymphoid Structures Generation through Graph-based Diffusion [54.37503714313661]
In this work, we leverage state-of-the-art graph-based diffusion models to generate biologically meaningful cell-graphs.
We show that the adopted graph diffusion model is able to accurately learn the distribution of cells in terms of their tertiary lymphoid structures (TLS) content.
arXiv Detail & Related papers (2023-10-10T14:37:17Z) - PACS: Prediction and analysis of cancer subtypes from multi-omics data
based on a multi-head attention mechanism model [2.275409158519155]
We propose a supervised multi-head attention mechanism model (SMA) to classify cancer subtypes successfully.
The attention mechanism and feature sharing module of the SMA model can successfully learn the global and local feature information of multi-omics data.
The SMA model achieves the highest accuracy, F1 macroscopic, F1 weighted, and accurate classification of cancer subtypes in simulated, single-cell, and cancer multiomics datasets.
arXiv Detail & Related papers (2023-08-21T03:54:21Z) - Classification of lung cancer subtypes on CT images with synthetic
pathological priors [41.75054301525535]
Cross-scale associations exist in the image patterns between the same case's CT images and its pathological images.
We propose self-generating hybrid feature network (SGHF-Net) for accurately classifying lung cancer subtypes on CT images.
arXiv Detail & Related papers (2023-08-09T02:04:05Z) - Heterogeneous Graph Neural Networks using Self-supervised Reciprocally
Contrastive Learning [102.9138736545956]
Heterogeneous graph neural network (HGNN) is a very popular technique for the modeling and analysis of heterogeneous graphs.
We develop for the first time a novel and robust heterogeneous graph contrastive learning approach, namely HGCL, which introduces two views on respective guidance of node attributes and graph topologies.
In this new approach, we adopt distinct but most suitable attribute and topology fusion mechanisms in the two views, which are conducive to mining relevant information in attributes and topologies separately.
arXiv Detail & Related papers (2022-04-30T12:57:02Z) - Many-to-One Distribution Learning and K-Nearest Neighbor Smoothing for
Thoracic Disease Identification [83.6017225363714]
deep learning has become the most powerful computer-aided diagnosis technology for improving disease identification performance.
For chest X-ray imaging, annotating large-scale data requires professional domain knowledge and is time-consuming.
In this paper, we propose many-to-one distribution learning (MODL) and K-nearest neighbor smoothing (KNNS) methods to improve a single model's disease identification performance.
arXiv Detail & Related papers (2021-02-26T02:29:30Z) - G-MIND: An End-to-End Multimodal Imaging-Genetics Framework for
Biomarker Identification and Disease Classification [49.53651166356737]
We propose a novel deep neural network architecture to integrate imaging and genetics data, as guided by diagnosis, that provides interpretable biomarkers.
We have evaluated our model on a population study of schizophrenia that includes two functional MRI (fMRI) paradigms and Single Nucleotide Polymorphism (SNP) data.
arXiv Detail & Related papers (2021-01-27T19:28:04Z) - The scalable Birth-Death MCMC Algorithm for Mixed Graphical Model
Learning with Application to Genomic Data Integration [0.0]
We propose a novel mixed graphical model approach to analyze multi-omic data of different types.
We find that our method is superior in terms of both computational efficiency and the accuracy of the model selection results.
arXiv Detail & Related papers (2020-05-08T16:34:58Z) - A Systematic Approach to Featurization for Cancer Drug Sensitivity
Predictions with Deep Learning [49.86828302591469]
We train >35,000 neural network models, sweeping over common featurization techniques.
We found the RNA-seq to be highly redundant and informative even with subsets larger than 128 features.
arXiv Detail & Related papers (2020-04-30T20:42:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.