SOTAVerified

Link Prediction

Link Prediction is a task in graph and network analysis where the goal is to predict missing or future connections between nodes in a network. Given a partially observed network, the goal of link prediction is to infer which links are most likely to be added or missing based on the observed connections and the structure of the network.

( Image credit: Inductive Representation Learning on Large Graphs )

Papers

Showing 11011125 of 1949 papers

TitleStatusHype
Representation Learning of Graphs Using Graph Convolutional Multilayer Networks Based on Motifs0
Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network0
Representation Learning over Dynamic Graphs0
ResVGAE: Going Deeper with Residual Modules for Link Prediction0
Disentangling Node Attributes from Graph Topology for Improved Generalizability in Link Prediction0
Representing Text for Joint Embedding of Text and Knowledge Bases0
Adaptive Candidate Generation for Scalable Edge-discovery Tasks on Data Graphs0
Causal Intervention for Measuring Confidence in Drug-Target Interaction Prediction0
Resource of Wikipedias in 31 Languages Categorized into Fine-Grained Named Entities0
Equipping SBMs with RBMs: An Explainable Approach for Analysis of Networks with Covariates0
DualDE: Dually Distilling Knowledge Graph Embedding for Faster and Cheaper Reasoning0
Are Hyperbolic Representations in Graphs Created Equal?0
A Relational-learning Perspective to Multi-label Chest X-ray Classification0
RETRO: Relation Retrofitting For In-Database Machine Learning on Textual Data0
A Relational Tucker Decomposition for Multi-Relational Link Prediction0
DocGraphLM: Documental Graph Language Model for Information Extraction0
Revisiting Graph Neural Networks for Link Prediction0
Document Network Projection in Pretrained Word Embedding Space0
Revisiting Knowledge Base Embedding as Tensor Decomposition0
Revisiting Neighborhood-based Link Prediction for Collaborative Filtering0
Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings0
Revisiting Virtual Nodes in Graph Neural Networks for Link Prediction0
r-GAT: Relational Graph Attention Network for Multi-Relational Graphs0
RGL: A Simple yet Effective Relation Graph Augmented Prompt-based Tuning Approach for Few-Shot Learning0
NodeSig: Binary Node Embeddings via Random Walk Diffusion0
Show:102550
← PrevPage 45 of 78Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1AutoKGEHits@100.56Unverified
2CP-N3-RPHits@100.55Unverified
3DistMult (after variational EM)Hits@100.55Unverified
4KG-R3Hits@100.54Unverified
5LASSHits@100.53Unverified
6MDE_advHits@100.53Unverified
7GFA-NNHits@100.52Unverified
8KGRefinerHits@100.49Unverified
9ComplEx NSCachingHits@100.48Unverified
10LogicENNHits@100.47Unverified
#ModelMetricClaimedVerifiedStatus
1MoCoKGCHits@100.88Unverified
2KERMITHits@100.83Unverified
3MoCoSAHits@100.82Unverified
4SimKGCIB(+PB+SN)Hits@100.82Unverified
5C-LMKE(bert-base)Hits@100.79Unverified
6LASSHits@100.79Unverified
7LP-BERTHits@100.75Unverified
8KGLMHits@100.74Unverified
9StAR(Self-Adp)Hits@100.71Unverified
10PALTHits@100.69Unverified
#ModelMetricClaimedVerifiedStatus
1OpenKE (han2018openke)training time (s)11Unverified
2LibKGE (ruffinelli2020you)training time (s)10Unverified
3GraphVite (zhu2019graphvite)training time (s)6Unverified
4Inverse ModelHits@100.96Unverified
5QuatDEHits@100.96Unverified
6LineaREHits@100.96Unverified
7AutoKGEHits@100.96Unverified
8MEI (small)Hits@100.96Unverified
9ComplEx-N3 (reciprocal)Hits@100.96Unverified
10RotatEHits@100.96Unverified
#ModelMetricClaimedVerifiedStatus
1OPTransEHits@100.9Unverified
2AutoKGEMRR0.86Unverified
3ComplEx-N3 (reciprocal)MRR0.86Unverified
4LineaREMRR0.84Unverified
5DistMult (after variational EM)MRR0.84Unverified
6QuatEMRR0.83Unverified
7SEEKMRR0.83Unverified
8MEI-BTDMRR0.81Unverified
9MEI (small)MRR0.8Unverified
10pRotatEMRR0.8Unverified