Adversarially Regularized Graph Autoencoder for Graph Embedding

Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the latent codes from the graphs, which often results in inferior embedding in real-world graph data.

Data and Resources

Cite this as

Shirui Pan, Ruiqi Hu, Guodong Long, Jing Jiang, Lina Yao, Chengqi Zhang (2024). Dataset: Adversarially Regularized Graph Autoencoder for Graph Embedding. https://doi.org/10.57702/1svmnj1p

DOI retrieved: December 16, 2024

Additional Info

Field Value
Created December 16, 2024
Last update December 16, 2024
Defined In https://doi.org/10.48550/arXiv.1802.04407
Author Shirui Pan
More Authors
Ruiqi Hu
Guodong Long
Jing Jiang
Lina Yao
Chengqi Zhang
Homepage https://arxiv.org/abs/1805.07423