A3Graph: adversarial attributed autoencoder for graph representation learning
2021
Recent years have witnessed a proliferation of graph representation techniques in social network analysis. Graph representation aims to map nodes in the graph into low-dimensional vector space while preserving as much information as possible. However, most existing methods ignore the robustness of learned latent vectors, which leads to inferior representation results due to sparse and noisy data in graphs. In this paper, we propose a novel framework, named A3Graph, which aims to improve the robustness and stability of graph representations. Specifically, we first construct an aggregation matrix by the combining positive point-wise mutual information matrix with the attribute matrix. Then, we enforce the autoencoder to reconstruct the aggregation matrix instead of the input attribute matrix. The enhancement autoencoder can incorporate structural and attributed information in a joint learning way to improve the noise-resilient during the learning process. Furthermore, an adversarial learning component is leveraged in our framework to impose a prior distribution on learned representations has been demonstrated as an effective mechanism in improving the robustness and stability in representation learning. Experimental studies on real-world datasets have demonstrated the effectiveness of the proposed A3Graph.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
1
Citations
NaN
KQI