Table of Contents
Fetching ...

GNN-Suite: a Graph Neural Network Benchmarking Framework for Biomedical Informatics

Sebestyén Kamp, Giovanni Stracquadanio, T. Ian Simpson

TL;DR

GNN-Suite standardises experimentation and reproducibility using the Nextflow workflow to evaluate GNN performance, and demonstrates its utility in identifying cancer-driver genes by constructing molecular networks from protein-protein interaction data from STRING and BioGRID and annotating nodes with features from the PCAWG, PID, and COSMIC-CGC repositories.

Abstract

We present GNN-Suite, a robust modular framework for constructing and benchmarking Graph Neural Network (GNN) architectures in computational biology. GNN-Suite standardises experimentation and reproducibility using the Nextflow workflow to evaluate GNN performance. We demonstrate its utility in identifying cancer-driver genes by constructing molecular networks from protein-protein interaction (PPI) data from STRING and BioGRID and annotating nodes with features from the PCAWG, PID, and COSMIC-CGC repositories. Our design enables fair comparisons among diverse GNN architectures including GAT, GAT3H, GCN, GCN2, GIN, GTN, HGCN, PHGCN, and GraphSAGE and a baseline Logistic Regression (LR) model. All GNNs were configured as standardised two-layer models and trained with uniform hyperparameters (dropout = 0.2; Adam optimiser with learning rate = 0.01; and an adjusted binary cross-entropy loss to address class imbalance) over an 80/20 train-test split for 300 epochs. Each model was evaluated over 10 independent runs with different random seeds to yield statistically robust performance metrics, with balanced accuracy (BACC) as the primary measure. Notably, GCN2 achieved the highest BACC (0.807 +/- 0.035) on a STRING-based network, although all GNN types outperformed the LR baseline, highlighting the advantage of network-based learning over feature-only approaches. Our results show that a common framework for implementing and evaluating GNN architectures aids in identifying not only the best model but also the most effective means of incorporating complementary data. By making GNN-Suite publicly available, we aim to foster reproducible research and promote improved benchmarking standards in computational biology. Future work will explore additional omics datasets and further refine network architectures to enhance predictive accuracy and interpretability in biomedical applications.

GNN-Suite: a Graph Neural Network Benchmarking Framework for Biomedical Informatics

TL;DR

GNN-Suite standardises experimentation and reproducibility using the Nextflow workflow to evaluate GNN performance, and demonstrates its utility in identifying cancer-driver genes by constructing molecular networks from protein-protein interaction data from STRING and BioGRID and annotating nodes with features from the PCAWG, PID, and COSMIC-CGC repositories.

Abstract

We present GNN-Suite, a robust modular framework for constructing and benchmarking Graph Neural Network (GNN) architectures in computational biology. GNN-Suite standardises experimentation and reproducibility using the Nextflow workflow to evaluate GNN performance. We demonstrate its utility in identifying cancer-driver genes by constructing molecular networks from protein-protein interaction (PPI) data from STRING and BioGRID and annotating nodes with features from the PCAWG, PID, and COSMIC-CGC repositories. Our design enables fair comparisons among diverse GNN architectures including GAT, GAT3H, GCN, GCN2, GIN, GTN, HGCN, PHGCN, and GraphSAGE and a baseline Logistic Regression (LR) model. All GNNs were configured as standardised two-layer models and trained with uniform hyperparameters (dropout = 0.2; Adam optimiser with learning rate = 0.01; and an adjusted binary cross-entropy loss to address class imbalance) over an 80/20 train-test split for 300 epochs. Each model was evaluated over 10 independent runs with different random seeds to yield statistically robust performance metrics, with balanced accuracy (BACC) as the primary measure. Notably, GCN2 achieved the highest BACC (0.807 +/- 0.035) on a STRING-based network, although all GNN types outperformed the LR baseline, highlighting the advantage of network-based learning over feature-only approaches. Our results show that a common framework for implementing and evaluating GNN architectures aids in identifying not only the best model but also the most effective means of incorporating complementary data. By making GNN-Suite publicly available, we aim to foster reproducible research and promote improved benchmarking standards in computational biology. Future work will explore additional omics datasets and further refine network architectures to enhance predictive accuracy and interpretability in biomedical applications.
Paper Structure (16 sections, 18 equations, 6 figures, 1 table)

This paper contains 16 sections, 18 equations, 6 figures, 1 table.

Figures (6)

  • Figure 1: GNN-Suite Workflow Diagram. A flowchart visualising the data pre-processing, training, evaluation, and visualisation steps of the GNN-suite nextflow pipeline as run on the Seqera Platform.
  • Figure 2: GNN model benchmarking results. Models were evaluated on held-out test nodes. The epoch corresponding to the highest mean balanced accuracy (BACC) is reported, with standard deviation calculated across $10$ independent model runs.
  • Figure 3: Training evaluation metrics. Variation in training performance metrics for the STRING-PID network configuration for different GNN architectures. Shaded regions around each line represent the standard error over $10$ independent runs.
  • Figure S1: Evaluation metrics on the test set during training, including the (training) loss on the STRING-COSMIC dataset for different GNN architectures. Shaded regions around each line represent the standard error over $10$ independent runs.
  • Figure S2: Evaluation metrics on the test set during training, including the (training) loss on the BioGRID-PID dataset for different GNN architectures. Shaded regions around each line represent the standard error over $10$ independent runs.
  • ...and 1 more figures