Variational Graph Normalized AutoEncoders

99Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Link prediction is one of the key problems for graph-structured data. With the advancement of graph neural networks, graph autoencoders (GAEs) and variational graph autoencoders (VGAEs) have been proposed to learn graph embeddings in an unsupervised way. It has been shown that these methods are effective for link prediction tasks. However, they do not work well in link predictions when a node whose degree is zero (i.g., isolated node) is involved. We have found that GAEs/VGAEs make embeddings of isolated nodes close to zero regardless of their content features. In this paper, we propose a novel Variational Graph Normalized AutoEncoder (VGNAE) that utilize L2-normalization to derive better embeddings for isolated nodes. We show that our VGNAEs outperform the existing state-of-the-art models for link prediction tasks. The code is available at https://github.com/SeongJinAhn/VGNAE.

Cite

CITATION STYLE

APA

Ahn, S. J., & Kim, M. (2021). Variational Graph Normalized AutoEncoders. In International Conference on Information and Knowledge Management, Proceedings (pp. 2827–2831). Association for Computing Machinery. https://doi.org/10.1145/3459637.3482215

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free