mims-harvard/decagon
Graph convolutional neural network for multirelational link prediction
Embeds nodes in multimodal graphs using relation-specific graph convolutions, enabling predictions across multiple edge types simultaneously. Implements multiple edge decoders (innerproduct, distmult, bilinear, dedicom) and loss functions (hinge, cross-entropy) to accommodate different prediction tasks. Built on TensorFlow with support for highly multi-relational settings, demonstrated on drug-drug interaction prediction using protein-protein interactions and drug-protein targets as auxiliary graph structure.
469 stars. No commits in the last 6 months.
Stars
469
Forks
151
Language
Jupyter Notebook
License
MIT
Category
Last pushed
Nov 21, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/embeddings/mims-harvard/decagon"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Related tools
eliorc/node2vec
Implementation of the node2vec algorithm.
ferencberes/online-node2vec
Node Embeddings in Dynamic Graphs
mims-harvard/nimfa
Nimfa: Nonnegative matrix factorization in Python
claws-lab/jodie
A PyTorch implementation of ACM SIGKDD 2019 paper "Predicting Dynamic Embedding Trajectory in...
mims-harvard/graphml-tutorials
Tutorials for Machine Learning on Graphs