REVIEW 1 cited by
Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGRAPHEMB, is a general framework that provides a novel means to performing graph-level embedding in a completely unsupervised and inductive manner. The learned neural network can be considered as a function that receives any graph as input, either seen or unseen in the training set, and transforms it into an embedding. A novel graph-level embedding generation mechanism called Multi-Scale Node Attention (MSNA), is proposed. Experiments on five real graph datasets show that UGRAPHEMB achieves competitive accuracy in the tasks of graph classification, similarity ranking, and graph visualization.
Forward citations
Cited by 1 Pith paper
-
Catch Causal Signals from Edges for Label Imbalance in Graph Classification
An edge-enhanced causal attention module (ECAL) improves graph classification accuracy under artificially induced label imbalance on PTC, Tox21, and ogbg-molhiv.
Discussion (0). Continue with ORCID to comment.