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 381–390 of 982 papers

TitleStatusHype
RobGC: Towards Robust Graph Condensation—0
A Scalable and Effective Alternative to Graph Transformers—0
A Unified Graph Selective Prompt Learning for Graph Neural Networks—0
OLGA: One-cLass Graph AutoencoderCode0
Introducing Diminutive Causal Structure into Graph Representation Learning—0
Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label ClassificationCode0
GEFL: Extended Filtration Learning for Graph ClassificationCode0
Enhancing Fairness in Unsupervised Graph Anomaly Detection through DisentanglementCode0
Know Your Neighborhood: General and Zero-Shot Capable Binary Function Search Powered by Call GraphletsCode0
Augmentation-based Unsupervised Cross-Domain Functional MRI Adaptation for Major Depressive Disorder Identification—0
Show:102550
← PrevPage 39 of 99Next →

Benchmark Results

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