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 91–100 of 982 papers

TitleStatusHype
An Efficient Memory Module for Graph Few-Shot Class-Incremental LearningCode0
Variational Graph Contrastive LearningCode0
HeteroSample: Meta-path Guided Sampling for Heterogeneous Graph Representation Learning—0
Learning From Graph-Structured Data: Addressing Design Issues and Exploring Practical Applications in Graph Representation Learning—0
Post-Hoc Robustness Enhancement in Graph Neural Networks with Conditional Random Fields—0
Centrality Graph Shift Operators for Graph Neural NetworksCode0
Non-Euclidean Mixture Model for Social Network EmbeddingCode0
Query-Efficient Adversarial Attack Against Vertical Federated Graph LearningCode0
Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural NetworksCode0
DECRL: A Deep Evolutionary Clustering Jointed Temporal Knowledge Graph Representation Learning Approach—0
Show:102550
← PrevPage 10 of 99Next →

Benchmark Results

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