Name
Abstract | ||
|---|---|---|
In recent years, unsupervised graph representation learning based on graph encoders has made significant progress. However, the existing methods have three shortcomings. First, the existing method based on graph convolutional network (GCN) cannot distinguish between different neighbor nodes. Second, these methods ignore the actual distribution of graph data. Finally, most existing embedding algorithms focus on restoring the feature matrix or adjacency matrix, which is not necessarily the best choice. Considering the above problems, an adaptive attention adversarial variational graph autoencoder (AAAVGE) is proposed. Its core ideas are (1) Use graph attention to distinguish the weights of different neighbor nodes. (2) Use the adversary strategy to guide the embedding vector to obey the true distribution of data. (3) Use an adaptive learning strategy to train the encoder. Link prediction experiments on four public benchmark data sets show that our proposed AAAVGE can significantly improve the performance of graph embedding compared with the mainstream graph embedding methods. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00185 | 19TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2021) |
Keywords | DocType | ISSN |
Adaptive, attention, adversary | Conference | 2158-9178 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ziqiang Weng | 1 | 1 | 0.69 |
| Weiyu Zhang | 2 | 0 | 0.34 |
| Zhongxiu Xia | 3 | 0 | 0.34 |