SOTAVerified

Graph Representation Learning

The goal of Graph Representation Learning is to construct a set of features (‘embeddings’) representing the structure of the graph and the data thereon. We can distinguish among Node-wise embeddings, representing each node of the graph, Edge-wise embeddings, representing each edge in the graph, and Graph-wise embeddings representing the graph as a whole.

Source: SIGN: Scalable Inception Graph Neural Networks

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 441–450 of 982 papers

TitleStatusHype
A Survey On Few-shot Knowledge Graph Completion with Structural and Commonsense Knowledge—0
Multi-View MOOC Quality Evaluation via Information-Aware Graph Representation Learning—0
WL-Align: Weisfeiler-Lehman Relabeling for Aligning Users across Networks via Regularized Representation LearningCode0
A Generalization of ViT/MLP-Mixer to GraphsCode1
Piecewise-Velocity Model for Learning Continuous-time Dynamic Node Representations—0
Graph Learning with Localized Neighborhood Fairness—0
Data Augmentation on Graphs: A Technical SurveyCode1
Robust Graph Representation Learning via Predictive Coding—0
Alleviating neighbor bias: augmenting graph self-supervise learning with structural equivalent positive samples—0
Learning Graph Search Heuristics—0
Show:102550
← PrevPage 45 of 99Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1Pi-net-linearError (mm)0.47—Unverified