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

TitleStatusHype
QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question AnsweringCode1
New Benchmarks for Learning on Non-Homophilous GraphsCode1
E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoTCode1
Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph ClassificationCode1
Adversarial Graph DisentanglementCode1
Exploiting Edge-Oriented Reasoning for 3D Point-based Scene Graph AnalysisCode1
Size-Invariant Graph Representations for Graph Classification ExtrapolationsCode1
Graph Autoencoder for Graph Compression and Representation LearningCode1
Towards a Unified Framework for Fair and Stable Graph Representation LearningCode1
Fast Graph Learning with Unique Optimal SolutionsCode1
Show:102550
← PrevPage 18 of 99Next →

Benchmark Results

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