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 801825 of 1949 papers

TitleStatusHype
Deep Insights into Noisy Pseudo Labeling on Graph DataCode0
NP^2L: Negative Pseudo Partial Labels Extraction for Graph Neural Networks0
DURENDAL: Graph deep learning framework for temporal heterogeneous networks0
Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link PredictionCode0
Leveraging Pre-trained Language Models for Time Interval Prediction in Text-Enhanced Temporal Knowledge GraphsCode0
SANGEA: Scalable and Attributed Network Generation0
TouchUp-G: Improving Feature Representation through Graph-Centric FinetuningCode0
Knowledge Graph Embedding: An Overview0
Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction0
Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning0
Temporal Smoothness Regularisers for Neural Link Predictors0
Human Action Co-occurrence in Lifestyle Vlogs using Graph Link PredictionCode0
A parameterised model for link prediction using node centrality and similarity measure based on graph embedding0
Circle Feature Graphormer: Can Circle Features Stimulate Graph Transformer?Code0
Force-directed graph embedding with hops distanceCode0
End-to-End Learning on Multimodal Knowledge GraphsCode0
A Text-based Approach For Link Prediction on Wikipedia ArticlesCode0
Link Prediction for Wikipedia Articles as a Natural Language Inference TaskCode0
Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation LearningCode0
Over-Squashing in Graph Neural Networks: A Comprehensive survey0
A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted NetworksCode0
Using Adamic-Adar Index Algorithm to Predict Volunteer Collaboration: Less is More0
Relational Concept Bottleneck ModelsCode0
Spear and Shield: Adversarial Attacks and Defense Methods for Model-Based Link Prediction on Continuous-Time Dynamic GraphsCode0
Geometric instability of graph neural networks on large graphsCode0
Show:102550
← PrevPage 33 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