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

Showing 976982 of 982 papers

TitleStatusHype
GESF: A Universal Discriminative Mapping Mechanism for Graph Representation Learning0
Hyperbolic Neural NetworksCode0
Feature Propagation on Graph: A New Perspective to Graph Representation Learning0
Learning to Make Predictions on Graphs with AutoencodersCode0
GraphGAN: Graph Representation Learning with Generative Adversarial NetsCode0
Marginalized graph autoencoder for graph clustering0
Deep Feature Learning for Graphs0
Show:102550
← PrevPage 40 of 40Next →

Benchmark Results

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