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 761–770 of 982 papers

TitleStatusHype
Graph Transformer for Graph-to-Sequence LearningCode0
Graph Representation Learning via Ladder Gamma Variational AutoencodersCode0
Hierarchical Multi-Relational Graph Representation Learning for Large-Scale Prediction of Drug-Drug InteractionsCode0
SMGRL: Scalable Multi-resolution Graph Representation LearningCode0
Social Recommendation through Heterogeneous Graph Modeling of the Long-term and Short-term Preference Defined by Dynamic Time SpansCode0
Hierarchical Topology Isomorphism Expertise Embedded Graph Contrastive LearningCode0
Point-Voxel Absorbing Graph Representation Learning for Event Stream based RecognitionCode0
PolyFormer: Scalable Node-wise Filters via Polynomial Graph TransformerCode0
What Do GNNs Actually Learn? Towards Understanding their RepresentationsCode0
Graph Representation Learning via Hard and Channel-Wise Attention NetworksCode0
Show:102550
← PrevPage 77 of 99Next →

Benchmark Results

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