bioRxivBioinformaticsPreprint
Proximity Measures as Graph Convolution Matrices for Link Prediction in Biological Networks
Abstract
MotivationLink prediction is an important and well-studied problem in computational biology, with a broad range of applications including disease gene prioritization, drug-disease associations, and drug response in cancer. The general principle in link prediction is to use the topological characteristics and the attributes-if available- of the nodes in the network to predict new links that are likely to emerge/disappear. Recently, graph representation learning methods, which aim to learn a low-dimensional representation of topological characteristics and the attributes of the nodes, have drawn increasing attention to solve the link prediction problem via learnt low-dimensional features. Most prominently, Graph Convolution Network (GCN)-based network embedding methods have demonstrated great promise in link prediction due to their ability of capturing non-linear information of the network. To date, GCN-based network embedding algorithms utilize a Laplacian matrix in their convolution layers as the convolution matrix and the effect of the convolution matrix on algorithm performance has not been comprehensively characterized in the context of link prediction in biomedical networks. On the other hand, for a variety of biomedical link prediction tasks, traditional node similarity measures such as Common Neighbor, Ademic-Adar, and other have shown promising results, and hence there is a need to systematically evaluate the node similarity measures as convolution matrices in terms of their usability and potential to further the state-of-the-art. ResultsWe select 8 representative node similarity measures as convolution matrices within the single-layered GCN graph embedding method and conduct a systematic comparison on 3 important biomedical link prediction tasks: drug-disease association (DDA) prediction, drug-drug interaction (DDI) prediction, protein-protein interaction (PPI) prediction. Our experimental results demonstrate that the node similarity-based convolution matrices significantly improves GCN-based embedding algorithms and deserve more attention in the future biomedical link prediction AvailabilityOur method is implemented as a python library and is available at githublink Contactmustafa.coskun@agu.edu.tr Supplementary informationSupplementary data are available at Bioinformatics online.
- research focus: benchmarking
- research focus: drug response / drug discovery
- research focus: protein structure prediction
- research focus: protein design
- approach: graph neural network
- approach: statistical model
- Citations
- 3
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Ultra-fast and Efficient Network Embedding for Gigascale Biological Datasets
Jianshu Zhao, Jean Pierre Both, Rob D. Knight·bioRxiv·Jun 18, 2025
- OMNI: Optimized Multi-view Network Integration with Heterogeneous Graph Attention for Biomedical Interaction Prediction
Gori Sankar Borah, Sukriti Tiwari, Selvaraman Nagamani·Journal of Chemical Information and ModelingPeer-reviewed·Jun 11, 2026
- Exploiting node metadata to predict interactions in large networks using graph embedding and neural networks
R. Runghen, D. B. Stouffer, G. V. Dalla Riva·bioRxiv·Jun 10, 2021
- Text mining-based word representations for biomedical data analysis and machine learning tasks
Halima Alachram, Hryhorii Chereda, … Philip Stegmaier·bioRxiv·Dec 9, 2020
- The probability of edge existence due to node degree: a baseline for network-based predictions
Michael Zietz, Daniel Himmelstein, … Casey S. Greene·GigaSciencePeer-reviewed·Jan 1, 2024
- Path-based reasoning in biomedical knowledge graphs with BioPathNet
Yue Hu, Svitlana Oleshko, … Annalisa Marsico·bioRxiv·Jun 17, 2024