Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity
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.
Cite
@article{arxiv.1904.01098,
title = {Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity},
author = {Yunsheng Bai and Hao Ding and Yang Qiao and Agustin Marinovic and Ken Gu and Ting Chen and Yizhou Sun and Wei Wang},
journal= {arXiv preprint arXiv:1904.01098},
year = {2019}
}
Comments
IJCAI 2019 camera ready version with supplementary material