Wasserstein Adversarially Regularized Graph Autoencoder

•Application of Wasserstein distance under graph settings.•Using Wasserstein distance for node embedding regularization.•Applying weight clipping and gradient penalty approaches for Lipschitz continuity.•Comparison of regularization against KL divergence and adversarial methods.•Detailed experiment...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) Vol. 541; p. 126235
Main Authors: Liang, Huidong, Gao, Junbin
Format: Journal Article
Language:English
Published: Elsevier B.V 07.07.2023
Subjects:
ISSN:0925-2312, 1872-8286
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first