.png){kind=icon}
.png){kind=icon}
Return
FastGAE: Scalable graph autoencoders with stochastic subgraph decoding
.png){kind=icon}
OA
AI
DOI：10.1016/j.neunet.2021.04.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph autoencoders (AE) and variational autoencoders (VAE) are powerful node embedding methods, but suffer from scalability issues. In this paper, we introduce FastGAE, a general framework to scale graph AE and VAE to large graphs with millions of nodes and edges. Our strategy, based on an effective stochastic subgraph decoding scheme, significantly speeds up the training of graph AE and VAE while preserving or even improving performances. We demonstrate the effectiveness of FastGAE on various real-world graphs, outperforming the few existing approaches to scale graph AE and VAE by a wide margin. (C) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Graph autoencoders
Graph variational autoencoders
Scalability
Graph convolutional networks
Link prediction
Node clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W