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 701–710 of 982 papers

TitleStatusHype
Geometric Graph Representation Learning via Maximizing Rate Reduction—0
Robust Graph Representation Learning for Local Corruption RecoveryCode0
A Variational Edge Partition Model for Supervised Graph Representation LearningCode0
Urban Region Profiling via A Multi-Graph Representation Learning Framework—0
Using Large-scale Heterogeneous Graph Representation Learning for Code Review Recommendations at Microsoft—0
Memory-based Message Passing: Decoupling the Message for Propogation from DiscriminationCode0
Learning Robust Representation through Graph Adversarial Contrastive Learning—0
SMGRL: Scalable Multi-resolution Graph Representation LearningCode0
Online Change Point Detection for Weighted and Directed Random Dot Product GraphsCode0
Joint Learning of Hierarchical Community Structure and Node Representations: An Unsupervised Approach—0
Show:102550
← PrevPage 71 of 99Next →

Benchmark Results

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