Optimizing Variational Graph Autoencoder for Community Detection with Dual Optimization

Variational Graph Autoencoder (VGAE) has recently gained traction for learning representations on graphs. Its inception has allowed models to achieve state-of-the-art performance for challenging tasks such as link prediction, rating prediction, and node clustering. However, a fundamental flaw exists...

Full description

Saved in:

Bibliographic Details
Published in:	Entropy (Basel, Switzerland) Vol. 22; no. 2; p. 197
Main Authors:	Choong, Jun Jin, Liu, Xin, Murata, Tsuyoshi
Format:	Journal Article
Language:	English
Published:	MDPI 01.02.2020 MDPI AG
Subjects:	graph neural network network embedding variational autoencoder variational inference
ISSN:	1099-4300, 1099-4300
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Variational Graph Autoencoder (VGAE) has recently gained traction for learning representations on graphs. Its inception has allowed models to achieve state-of-the-art performance for challenging tasks such as link prediction, rating prediction, and node clustering. However, a fundamental flaw exists in Variational Autoencoder (VAE)-based approaches. Specifically, merely minimizing the loss of VAE increases the deviation from its primary objective. Focusing on Variational Graph Autoencoder for Community Detection (VGAECD) we found that optimizing the loss using the stochastic gradient descent often leads to sub-optimal community structure especially when initialized poorly. We address this shortcoming by introducing a dual optimization procedure. This procedure aims to guide the optimization process and encourage learning of the primary objective. Additionally, we linearize the encoder to reduce the number of learning parameters. The outcome is a robust algorithm that outperforms its predecessor.
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
ISSN:	1099-4300 1099-4300
DOI:	10.3390/e22020197