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 871–880 of 982 papers

TitleStatusHype
Towards Expressive Graph RepresentationCode0
NodeSig: Binary Node Embeddings via Random Walk Diffusion—0
div2vec: Diversity-Emphasized Node Embedding—0
Polyp-artifact relationship analysis using graph inductive learned representations—0
Online Disease Self-diagnosis with Inductive Heterogeneous Graph Convolutional Networks—0
About Graph Degeneracy, Representation Learning and ScalabilityCode0
CAGNN: Cluster-Aware Graph Neural Networks for Unsupervised Graph Representation Learning—0
VeRNAl: Mining RNA Structures for Fuzzy Base Pairing Network MotifsCode0
OFFER: A Motif Dimensional Framework for Network Representation Learning—0
Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art—0
Show:102550
← PrevPage 88 of 99Next →

Benchmark Results

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