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 771–780 of 982 papers

TitleStatusHype
A Transferable General-Purpose Predictor for Neural Architecture Search—0
SpecTRA: Spectral Transformer for Graph Representation Learning—0
BCDR: Betweenness Centrality-based Distance Resampling for Graph Shortest Distance Embedding—0
Scalable Hierarchical Embeddings of Complex Networks—0
Interrogating Paradigms in Self-supervised Graph Representation Learning—0
EBSD Grain Knowledge Graph Representation Learning for Material Structure-Property Prediction—0
A Deep Latent Space Model for Directed Graph Representation Learning—0
Edge but not Least: Cross-View Graph Pooling—0
Graphine: A Dataset for Graph-aware Terminology Definition GenerationCode0
X-GOAL: Multiplex Heterogeneous Graph Prototypical Contrastive Learning—0
Show:102550
← PrevPage 78 of 99Next →

Benchmark Results

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