Adaptive Graph Encoder for Attributed Graph Embedding

07/03/2020
by   Ganqu Cui, et al.
0

Attributed graph embedding, which learns vector representations from graph topology and node features, is a challenging task for graph analysis. Recently, methods based on graph convolutional networks (GCNs) have made great progress on this task. However,existing GCN-based methods have three major drawbacks. Firstly,our experiments indicate that the entanglement of graph convolutional filters and weight matrices will harm both the performance and robustness. Secondly, we show that graph convolutional filters in these methods reveal to be special cases of generalized Laplacian smoothing filters, but they do not preserve optimal low-pass characteristics. Finally, the training objectives of existing algorithms are usually recovering the adjacency matrix or feature matrix, which are not always consistent with real-world applications. To address these issues, we propose Adaptive Graph Encoder (AGE), a novel attributed graph embedding framework. AGE consists of two modules: (1) To better alleviate the high-frequency noises in the node features, AGE first applies a carefully-designed Laplacian smoothing filter. (2) AGE employs an adaptive encoder that iteratively strengthens the filtered features for better node embeddings. We conduct experiments using four public benchmark datasets to validate AGE on node clustering and link prediction tasks. Experimental results show that AGE consistently outperforms state-of-the-art graph embedding methods considerably on these tasks.

READ FULL TEXT

page 3

page 8

research
10/02/2019

Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks

Graph autoencoders (AE) and variational autoencoders (VAE) recently emer...
research
11/18/2019

GLMNet: Graph Learning-Matching Networks for Feature Matching

Recently, graph convolutional networks (GCNs) have shown great potential...
research
07/12/2020

Heterogeneous Attributed Network Embedding with Graph Convolutional Networks

Network embedding which assigns nodes in networks to lowdimensional repr...
research
06/04/2019

Attributed Graph Clustering via Adaptive Graph Convolution

Attributed graph clustering is challenging as it requires joint modellin...
research
12/22/2021

SkipNode: On Alleviating Over-smoothing for Deep Graph Convolutional Networks

Over-smoothing is a challenging problem, which degrades the performance ...
research
02/24/2021

Graphfool: Targeted Label Adversarial Attack on Graph Embedding

Deep learning is effective in graph analysis. It is widely applied in ma...
research
10/28/2021

On Provable Benefits of Depth in Training Graph Convolutional Networks

Graph Convolutional Networks (GCNs) are known to suffer from performance...

Please sign up or login with your details

Forgot password? Click here to reset