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 461–470 of 982 papers

TitleStatusHype
Hybrid Low-order and Higher-order Graph Convolutional Networks—0
Distribution Preserving Graph Representation Learning—0
Hierarchical Transformer for Scalable Graph Learning—0
Feature Propagation on Graph: A New Perspective to Graph Representation Learning—0
div2vec: Diversity-Emphasized Node Embedding—0
Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One Assignments—0
Harvesting Textual and Structured Data from the HAL Publication Repository—0
Haste Makes Waste: A Simple Approach for Scaling Graph Neural Networks—0
HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption—0
HiGraphDTI: Hierarchical Graph Representation Learning for Drug-Target Interaction Prediction—0
Show:102550
← PrevPage 47 of 99Next →

Benchmark Results

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