Topological based classification using graph convolutional networks
arXiv:1911.06892
Abstract
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 with topological features of the nodes. We use this association to improve Graph machine learning in general and specifically, Graph Convolutional Networks (GCN). First, we show that even in the absence of any external information on nodes, a good accuracy can be obtained on the prediction of the node class using either topological features, or using the neighbors class as an input to a GCN. This accuracy is slightly less than the one that can be obtained using content based GCN. Secondly, we show that explicitly adding the topology as an input to the GCN does not improve the accuracy when combined with external information on nodes. However, adding an additional adjacency matrix with edges between distant nodes with similar topology to the GCN does significantly improve its accuracy, leading to results better than all state of the art methods in multiple datasets.
arXiv admin note: text overlap with arXiv:1904.07787
References in corpus (11)
- Fast unfolding of communities in large networks
- Semi-Supervised Classification with Graph Convolutional Networks
- Spectral Networks and Locally Connected Networks on Graphs
- Deep Convolutional Networks on Graph-Structured Data
- Pitfalls of Graph Neural Network Evaluation
- Gated Graph Sequence Neural Networks
- Revisiting Semi-Supervised Learning with Graph Embeddings
- Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking
- N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification
- Fast Interactive Object Annotation with Curve-GCN
- Regional based query in graph active learning