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 461–470 of 982 papers

TitleStatusHype
Dynamic Spiking Framework for Graph Neural Networks—0
Symmetry Breaking and Equivariant Neural Networks—0
EdgePruner: Poisoned Edge Pruning in Graph Contrastive Learning—0
Isomorphic-Consistent Variational Graph Auto-Encoders for Multi-Level Graph Representation Learning—0
Understanding Community Bias Amplification in Graph Representation Learning—0
On the Initialization of Graph Neural NetworksCode0
HGPROMPT: Bridging Homogeneous and Heterogeneous Graphs for Few-shot Prompt Learning—0
Large-scale Graph Representation Learning of Dynamic Brain Connectome with Transformers—0
Normed Spaces for Graph EmbeddingCode0
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers—0
Show:102550
← PrevPage 47 of 99Next →

Benchmark Results

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