Robust Graph Data Learning via Latent Graph Convolutional Representation

2019-04-26 · Bo Jiang, Ziyan Zhang, Bin Luo

Graph Convolutional Representation (GCR) has achieved impressive performance for graph data representation. However, existing GCR is generally defined on the input fixed graph which may restrict the representation capacity and also be vulnerable to the structural attacks and noises. To address this issue, we propose a novel Latent Graph Convolutional Representation (LatGCR) for robust graph data representation and learning. Our LatGCR is derived based on reformulating graph convolutional representation from the aspect of graph neighborhood reconstruction. Given an input graph $\textbf{A}$, LatGCR aims to generate a flexible latent graph $\widetilde{\textbf{A}}$ for graph convolutional representation which obviously enhances the representation capacity and also performs robustly w.r.t graph structural attacks and noises. Moreover, LatGCR is implemented in a self-supervised manner and thus provides a basic block for both supervised and unsupervised graph learning tasks. Experiments on several datasets demonstrate the effectiveness and robustness of LatGCR.

📄 PDF Abstract BibTeX arXiv:1904.11883

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Learning Node Classification Representation Learning

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

GCN A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of [convolutional neural…

Robust Graph Data Learning with Latent Graph Convolutional Representation

2021-09-29 · Bo Jiang, Ziyan Zhang, Bin Luo

Graph Learning

Independence Promoted Graph Disentangled Networks

2019-11-26 · Yanbei Liu, Xiao Wang, Shu Wu, Zhitao Xiao

We address the problem of disentangled representation learning with independent latent factors in graph convolutional networks (GCNs). The current methods usually learn node representation by describing its neighborhood …

Clustering Graph Classification Graph Clustering Representation Learning

Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning

2019-08-07 · ICCV 2019 10 · Jiwoong Park, Minsik Lee, Hyung Jin Chang, Kyuewang Lee 외

We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoe…

Clustering Decoder Graph Clustering Graph Representation Learning+3

VEM-GCN: Topology Optimization with Variational EM for Graph Convolutional Networks

2021-01-01 · Rui Yang, Wenrui Dai, Chenglin Li, Junni Zou 외

Over-smoothing has emerged as a severe problem for node classification with graph convolutional networks (GCNs). In the view of message passing, the over-smoothing issue is caused by the observed noisy graph topology tha…

Classification General Classification Node Classification Stochastic Block Model

Learning Network Representations with Disentangled Graph Auto-Encoder

2024-02-02 · Di Fan, Chuanhou Gao

The (variational) graph auto-encoder is widely used to learn representations for graph-structured data. However, the formation of real-world graphs is a complicated and heterogeneous process influenced by latent factors.…

Decoder Learning Network Representations