Javascript must be enabled to continue!
Empirical Assessment of Graph Embedding Techniques for Predicting Missing Links in Biological Networks
View through CrossRef
<p>Network science tries to shed light into the complex relationships among entities of a system. For instance, biological networks represent relations between macro molecules such as genes, proteins or other small chemicals. Often potential links are guessed computationally due to expensive nature of wet lab experiments. Conventional link prediction techniques consider local network wiring structure, which may not able to infer true relationships. The recent approaches of graph embedding (or representation learning) aims to capture the complete network structure that may be utilized for link prediction. </p>
<p>In this work, we assess the performance of ten (10) state-of-the-art embedding techniques for their effectiveness of link prediction in homogeneous and heterogeneous biological networks. Majority of the graph embedding methods, in its original form, not in a position to predict links. We use the latent representation of the network produce by the embedding methods and recreate the network using various similarity and kernal functions. We evaluate nine (09) such functions in combination with candidate embedding methods. We even compare the performance of five (05) traditional, local structure based link prediction methods to show the superiority. </p>
<p>Experimental results clearly reveal that Graph Neural Network (GNN) and Attention based encoders with dot product based decoder are the best performers in predicting missing links for both homogeneous and heterogeneous biological network. </p>
Institute of Electrical and Electronics Engineers (IEEE)
Title: Empirical Assessment of Graph Embedding Techniques for Predicting Missing Links in Biological Networks
Description:
<p>Network science tries to shed light into the complex relationships among entities of a system.
For instance, biological networks represent relations between macro molecules such as genes, proteins or other small chemicals.
Often potential links are guessed computationally due to expensive nature of wet lab experiments.
Conventional link prediction techniques consider local network wiring structure, which may not able to infer true relationships.
The recent approaches of graph embedding (or representation learning) aims to capture the complete network structure that may be utilized for link prediction.
</p>
<p>In this work, we assess the performance of ten (10) state-of-the-art embedding techniques for their effectiveness of link prediction in homogeneous and heterogeneous biological networks.
Majority of the graph embedding methods, in its original form, not in a position to predict links.
We use the latent representation of the network produce by the embedding methods and recreate the network using various similarity and kernal functions.
We evaluate nine (09) such functions in combination with candidate embedding methods.
We even compare the performance of five (05) traditional, local structure based link prediction methods to show the superiority.
</p>
<p>Experimental results clearly reveal that Graph Neural Network (GNN) and Attention based encoders with dot product based decoder are the best performers in predicting missing links for both homogeneous and heterogeneous biological network.
</p>.
Related Results
Empirical Assessment of Graph Embedding Techniques for Predicting Missing Links in Biological Networks
Empirical Assessment of Graph Embedding Techniques for Predicting Missing Links in Biological Networks
<p>Network science tries to shed light into the complex relationships among entities of a system. For instance, biological networks represent relations between macro molecule...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Long-range superharmonic Josephson current and spin-triplet pairing correlations in a junction with ferromagnetic bilayers
Long-range superharmonic Josephson current and spin-triplet pairing correlations in a junction with ferromagnetic bilayers
AbstractThe long-range spin-triplet supercurrent transport is an interesting phenomenon in the superconductor/ferromagnet ("Equation missing") heterostructure containing noncolline...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Embedding Complex Networks
Embedding Complex Networks
<p>Graph embedding is a transformation of nodes of a graph into a set of vectors. A good embedding should capture the graph topology, node-to-node relationship, and other rel...
Embedding Complex Networks
Embedding Complex Networks
<p>Graph embedding is a transformation of nodes of a graph into a set of vectors. A good embedding should capture the graph topology, node-to-node relationship, and other rel...
VANLO - Interactive visual exploration of aligned biological networks
VANLO - Interactive visual exploration of aligned biological networks
Abstract
Background
Protein-protein interaction (PPI) is fundamental to many biological processes. In the course of evolution, biological network...
An Efficient ZZW Construction Using Low-Density Generator-Matrix Embedding Techniques
An Efficient ZZW Construction Using Low-Density Generator-Matrix Embedding Techniques
A novel steganographic algorithm based on ZZW construction is proposed to improve the steganographic embedding efficiency. Low-density generator-matrix (LDGM) embedding is an effic...

