Locality Preserving Dense Graph Convolutional Networks with Graph Context-Aware Node Representations
원문 초록
Graph convolutional networks (GCNs) have been widely used for representation learning on graph data, which can capture structural patterns on a graph via specifically designed convolution and readout operations. In many graph classification applications, GCN-based approaches have outperformed traditional methods. However, most of the existing GCNs are inefficient to preserve local information of graphs -- a limitation that is especially problematic for graph classification. In this work, we propose a locality-preserving dense GCN with graph context-aware node representations. Specifically, our proposed model incorporates a local node feature reconstruction module to preserve initial node features into node representations, which is realized via a simple but effective encoder-decoder mechanism. To capture local structural patterns in neighbourhoods representing different ranges of locality, dense connectivity is introduced to connect each convolutional layer and its corresponding readout with all previous convolutional layers. To enhance node representativeness, the output of each convolutional layer is concatenated with the output of the previous layer's readout to form a global context-aware node representation. In addition, a self-attention module is introduced to aggregate layer-wise representations to form the final representation. Experiments on benchmark datasets demonstrate the superiority of the proposed model over state-of-the-art methods in terms of classification accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning to Represent the Evolution of Dynamic Graphs with Recurrent Models
Beyond the Attention: Distinguish the Discriminative and Confusable Features For Fine-grained Image Classification
Boosting Team Modeling through Tempo-Relational Representation Learning
Large-Scale Few-Shot Classification with Semi-supervised Hierarchical k-Probabilistic PCAs
Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective
Deep Double Incomplete Multi-view Multi-label Learning with Incomplete Labels and Missing Views
토론
이 논문과 연결된 포럼 글이 아직 없습니다.