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 851–860 of 982 papers

TitleStatusHype
Biomedical Knowledge Graph Refinement and Completion using Graph Representation Learning and Top-K Similarity Measure—0
Decimated Framelet System on Graphs and Fast G-Framelet TransformsCode0
Pair-view Unsupervised Graph Representation Learning—0
CommPOOL: An Interpretable Graph Pooling Framework for Hierarchical Graph Representation Learning—0
Unsupervised Adversarially-Robust Representation Learning on Graphs—0
A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources—0
A Data-Driven Study of Commonsense Knowledge using the ConceptNet Knowledge Base—0
GL-Coarsener: A Graph representation learning framework to construct coarse grid hierarchy for AMG solversCode0
EGAD: Evolving Graph Representation Learning with Self-Attention and Knowledge Distillation for Live Video Streaming EventsCode0
VStreamDRLS: Dynamic Graph Representation Learning with Self-Attention for Enterprise Distributed Video Streaming SolutionsCode0
Show:102550
← PrevPage 86 of 99Next →

Benchmark Results

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