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 261–270 of 982 papers

TitleStatusHype
Hierarchical Topology Isomorphism Expertise Embedded Graph Contrastive LearningCode0
Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution GeneralizationCode1
LightGCN: Evaluated and EnhancedCode0
scBiGNN: Bilevel Graph Representation Learning for Cell Type Classification from Single-cell RNA Sequencing Data—0
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
Relational Deep Learning: Graph Representation Learning on Relational DatabasesCode1
Show:102550
← PrevPage 27 of 99Next →

Benchmark Results

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