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 541–550 of 982 papers

TitleStatusHype
Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node ClusteringCode0
Union Subgraph Neural NetworksCode0
Tokenized Graph Transformer with Neighborhood Augmentation for Node Classification in Large Graphs—0
Causal-Based Supervision of Attention in Graph Neural Network: A Better and Simpler Choice towards Powerful Attention—0
Neural Oscillators are Universal—0
Semantic Random Walk for Graph Representation Learning in Attributed Graphs—0
Dynamic Graph Representation Learning for Depression Screening with Transformer—0
AmGCL: Feature Imputation of Attribute Missing Graph via Self-supervised Contrastive Learning—0
Multi-View Graph Representation Learning for Answering Hybrid Numerical Reasoning QuestionCode0
Hierarchical Transformer for Scalable Graph Learning—0
Show:102550
← PrevPage 55 of 99Next →

Benchmark Results

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