Back

BiGAT-Fusion: Node-Wise Gated Bidirectional Graph Attention for Drug Repurposing

Ding, W.

2026-03-02 bioinformatics
10.64898/2026.02.27.708641 bioRxiv
Show abstract

Drug discovery remains slow, costly, and failure-prone, motivating computational drug repurposing that prioritizes plausible drug-disease associations (DDAs). However, DDA prediction faces three stubborn challenges: (i) extreme class imbalance with few confirmed links amid vast unknowns; (ii) directional asymmetry on the bipartite drug-disease graph that standard message passing underutilizes; and (iii) static fusion of heterogeneous evidence, where fixed rules cannot adapt the relative value of feature (similarity) and topology (association) views across nodes. We present BiGAT-Fusion, a two view graph neural model that addresses these issues end-to-end. Feature view embeddings are learned on kNN graphs built from drug-drug and disease-disease similarities, while topology view embeddings are learned via a bidirectional graph attention layer that explicitly models drug[->]disease and disease[->]drug aggregation. The views are combined by type specific, node wise gates that adaptively weight evidence per node. Pair scores are produced by a residual mixture of experts head that augments a main Multi-Layer Perceptron (MLP) with a bounded low rank bilinear residual and node biases. Under repeated K-fold cross validation with validation driven selection, and with the topology graph constructed strictly from training positives, BiGAT-Fusion achieves state-of-the-art AUPRC on standard benchmarks (Gdataset, Cdataset, LRSSL, Ldataset) while remaining competitive in AUROC. Analyses of learned gates and directional attentions corroborate the models design. BiGAT-Fusion thus offers a practical, interpretable component for large-scale, computer-aided drug repurposing.

Matching journals

The top 6 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.