Visiting Distant Neighbors in Graph Convolutional Networks
We extend the graph convolutional network method for deep learning on graph data to higher order in terms of neighboring nodes. In order to construct representations for a node in a graph, in addition to the features of the node and its immediate neighboring nodes, we also include more distant nodes in the calculations. In experimenting with a number of publicly available citation graph datasets, we show that this higher order neighbor visiting pays off by outperforming the original model especially when we have a limited number of available labeled data points for the training of the model.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks
Multiple recent studies show a paradox in graph convolutional networks (GCNs), that is, shallow architectures limit the capability of learning information from high-order neighbors, while deep architectures suffer from o…
Contrastive LearningNode ClassificationRepresentation LearningTopological based classification using graph convolutional networks
In colored graphs, node classes are often associated with either their neighbors class or with information not incorporated in the graph associated with each node. We here propose that node classes are also associated wi…
ClassificationGeneral ClassificationUnleashing the Power of Transformer for Graphs
Despite recent successes in natural language processing and computer vision, Transformer suffers from the scalability problem when dealing with graphs. The computational complexity is unacceptable for large-scale graphs,…
Knowledge GraphsRevisiting Layer-wise Sampling in Fast Training for Graph Convolutional Networks
To accelerate the training of graph convolutional networks (GCN), many sampling-based methods have been developed for approximating the embedding aggregation. Among them, a layer-wise approach recursively performs import…
Revisiting Graph Construction for Fast Image Segmentation
In this paper, we propose a simple but effective method for fast image segmentation. We re-examine the locality-preserving character of spectral clustering by constructing a graph over image regions with both global and …
Clusteringgraph constructiongraph partitioningImage Segmentation+2