Attributed Graph Embedding Based on Attention with Cluster
Open Access
- 1 December 2022
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4563
Abstract
Graph embedding is of great significance for the research and analysis of graphs. Graph embedding aims to map nodes in the network to low-dimensional vectors while preserving information in the original graph of nodes. In recent years, the appearance of graph neural networks has significantly improved the accuracy of graph embedding. However, the influence of clusters was not considered in existing graph neural network (GNN)-based methods, so this paper proposes a new method to incorporate the influence of clusters into the generation of graph embedding. We use the attention mechanism to pass the message of the cluster pooled result and integrate the whole process into the graph autoencoder as the third layer of the encoder. The experimental results show that our model has made great improvement over the baseline methods in the node clustering and link prediction tasks, demonstrating that the embeddings generated by our model have excellent expressiveness.Keywords
This publication has 21 references indexed in Scilit:
- Adversarially Regularized Graph Autoencoder for Graph Embedding2018
- MGAE2017
- Structural Deep Network Embedding2016
- node2vec2016
- GraRep2015
- LINE2015
- DeepWalk2014
- Community detection as an inference problemPhysical Review E, 2006
- Finding community structure in networks using the eigenvectors of matricesPhysical Review E, 2006
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982