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 581–590 of 982 papers

TitleStatusHype
A Survey on Spectral Graph Neural Networks—0
Heterophily-Aware Graph Attention Network—0
Spectral Augmentations for Graph Contrastive Learning—0
GRANDE: a neural model over directed multigraphs with application to anti-money laundering—0
Simple yet Effective Gradient-Free Graph Convolutional Networks—0
Graph Anomaly Detection in Time Series: A Survey—0
Unbiased and Efficient Self-Supervised Incremental Contrastive LearningCode0
HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption—0
Uplink Scheduling in Federated Learning: an Importance-Aware Approach via Graph Representation Learning—0
STERLING: Synergistic Representation Learning on Bipartite Graphs—0
Show:102550
← PrevPage 59 of 99Next →

Benchmark Results

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