Graph
Link Prediction

đź”®Link Prediction

NEW

Also known as: Edge prediction

Predicting missing, future, or likely relationships between nodes in a graph using structural and feature information.

DESCRIPTION

Link prediction estimates whether a relationship exists or will form between two nodes. Classical heuristics include common neighbors and Adamic–Adar; modern methods use embeddings and GNNs. It powers recommendations, fraud detection, and knowledge graph completion. Evaluation uses temporal splits, negative sampling, and metrics like AUC or Hits@K. Robust pipelines manage leakage by preserving temporal order and separating overlapping neighborhoods.

ALTERNATIVE DEFINITIONS

Wikipedia

Link prediction is the problem of predicting the existence of a link between two nodes in a network.

Concise problem statement focusing on link existence.

Source

Stanford SNAP (CS224W)

Link prediction aims to infer missing edges or forecast future interactions using network topology and node features.

Explicates both missing and future links and feature use.

Source

arXiv

The link prediction task asks whether two nodes should be connected, based on structural patterns and learned representations.

Highlights role of learned representations in modern approaches.

Source

Graph Neural Network Graph Embedding Similarity Measure Common Neighbors Preferential Attachment Knowledge Graph Completion Node2Vec Graph Convolutional Network Matrix Factorization Recommendation System

COMPETING TERMS

Community Detection

RELATIONS

KNOWLEDGE AREAS

AI Data Science Semantic & Knowledge Modeling

TARGET AUDIENCE

Data Scientist AI Engineer MLOps Engineer Data Modeler

EXTERNAL SOURCES

TOP QUESTIONS

Common neighbors, Jaccard, Adamic–Adar, and preferential attachment provide quick, interpretable baselines.

Category: Methods

Use temporal splits, negative sampling, and metrics like AUC, MAP, or Hits@K.

Category: Metrics

It prevents leakage by ensuring future links aren’t predicted with future information.

Category: Best Practices

GNNs aggregate neighborhood information and learn representations capturing higher-order structure.

Category: AI

Sampling non-existent edges as negatives for supervised training, balanced to reflect graph sparsity.

Category: Concepts

Class imbalance and popularity bias can inflate scores; calibration and stratified sampling help.

Category: Risks

Friend suggestions, product recommendations, fraud ring detection, and knowledge graph completion.

Category: Applications

Heterogeneous graphs require type-specific features or meta-paths to capture semantics.

Category: Modeling

Features complement topology, improving prediction when structure alone is insufficient.

Category: Concepts