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 751760 of 982 papers

TitleStatusHype
Het-node2vec: second order random walk sampling for heterogeneous multigraphs embeddingCode0
GTNet: A Tree-Based Deep Graph Learning ArchitectureCode0
Do Transformers Really Perform Badly for Graph Representation?Code0
Graph-wise Common Latent Factor Extraction for Unsupervised Graph Representation LearningCode0
Bridging the Gap between Community and Node Representations: Graph Embedding via Community DetectionCode0
Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature AttacksCode0
ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation LearningCode0
Hierarchical and Unsupervised Graph Representation Learning with Loukas's CoarseningCode0
MGC: A Complex-Valued Graph Convolutional Network for Directed GraphsCode0
Graph Traversal with Tensor Functionals: A Meta-Algorithm for Scalable LearningCode0
Show:102550
← PrevPage 76 of 99Next →

Benchmark Results

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