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 561–570 of 982 papers

TitleStatusHype
Negative Sampling in Knowledge Graph Representation Learning: A Review—0
Neighborhood Convolutional Network: A New Paradigm of Graph Neural Networks for Node Classification—0
Neighbour-level Message Interaction Encoding for Improved Representation Learning on Graphs—0
Neural Oscillators are Universal—0
Neural Spacetimes for DAG Representation Learning—0
node2coords: Graph Representation Learning with Wasserstein Barycenters—0
Node Classification Meets Link Prediction on Knowledge Graphs—0
Node Embeddings via Neighbor Embeddings—0
Node Level Graph Autoencoder: Unified Pretraining for Textual Graph Learning—0
OCTAL: Graph Representation Learning for LTL Model Checking—0
Show:102550
← PrevPage 57 of 99Next →

Benchmark Results

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