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

Showing 291300 of 982 papers

TitleStatusHype
An Empirical Study of Retrieval-enhanced Graph Neural NetworksCode0
Heterogeneous Deep Graph InfomaxCode0
A knowledge graph representation learning approach to predict novel kinase-substrate interactionsCode0
HeGAE-AC: heterogeneous graph auto-encoder for attribute completionCode0
Het-node2vec: second order random walk sampling for heterogeneous multigraphs embeddingCode0
Hierarchical and Unsupervised Graph Representation Learning with Loukas's CoarseningCode0
Hyperbolic Neural NetworksCode0
Maximizing Cohesion and Separation in Graph Representation Learning: A Distance-aware Negative Sampling ApproachCode0
Decimated Framelet System on Graphs and Fast G-Framelet TransformsCode0
A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted NetworksCode0
Show:102550
← PrevPage 30 of 99Next →

Benchmark Results

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