.png){kind=icon}
Return
Adversarial regularize graph variational autoencoder based on encoder optimization strategy
.png){kind=icon}
OA
AI
DOI：10.1007/s10462-024-11068-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph variational autoencoders (VAEs) have been widely used to address the representation problem of graph nodes. However, most existing graph VAEs focus on minimizing reconstruction loss and overlook the uncertainty in the latent distribution and the issue of posterior collapse during training. An Adversarial Regularize Graph Variational Autoencoder Based on Encoder Optimization Strategy (MCM-ARVGE) is proposed from the perspective of network structure and loss function. MCM-ARVGE introduces a Multi-dimensional Cloud Generator (MCG) that transforms the traditional encoder, expanding the Gaussian distribution into a Gaussian cloud distribution. Furthermore, MCM-ARVGE employs the idea of adversarial regularization to train the Gaussian cloud distribution, reducing the randomness of the Gaussian cloud distribution. Finally, based on the Gaussian cloud distribution, an effective uncertainty similarity measurement method for cloud distributions is introduced to address the problem of posterior collapse. Experimental results validate the universality and effectiveness of MCM-ARVGE, as it outperforms the baseline model in graph embedding tasks.
Keywords:
Autoencoder
Adversarial network
Graph embedding
Multi-dimensional cloud
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more