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 901–910 of 982 papers

TitleStatusHype
Wide-AdGraph: Detecting Ad Trackers with a Wide Dependency Chain GraphCode0
MxPool: Multiplex Pooling for Hierarchical Graph Representation Learning—0
Graph Representation Learning via Ladder Gamma Variational AutoencodersCode0
Gossip and Attend: Context-Sensitive Graph Representation LearningCode0
SAC: Accelerating and Structuring Self-Attention via Sparse Adaptive Connection—0
Unsupervised Hierarchical Graph Representation Learning by Mutual Information MaximizationCode0
Learning by Sampling and Compressing: Efficient Graph Representation Learning with Extremely Limited Annotations—0
Learning to Hash with Graph Neural Networks for Recommender Systems—0
Self-Supervised Graph Representation Learning via Global Context Prediction—0
Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees—0
Show:102550
← PrevPage 91 of 99Next →

Benchmark Results

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