Abstract
Graph convolutional networks (GCNs) were a great step towards extending deep learning to graphs. GCN uses the graph G and the feature matrix X as inputs. However, in most cases the graph G is missing and we are only provided with the feature matrix X. To solve this problem, classical graphs such as k-nearest neighbor (k-nn) are usually used to construct the graph G and initialize the GCN. Although it is computationally efficient to construct k-nn graphs, the constructed graph might not be very useful for learning. In a k-nn graph, points are restricted to have a fixed number of edges, and all edges in the graph have equal weights. Our contribution is Initializing GCN using a graph with varying weights on edges, which provides better performance compared to k-nn initialization. Our proposed method is based on random projection forest (rpForest). rpForest enables us to assign varying weights on edges indicating varying importance, which enhanced the learning. The number of trees is a hyperparameter in rpForest. We performed spectral analysis to help us setting this parameter in the right range. In the experiments, initializing the GCN using rpForest provides better results compared to k-nn initialization.•Constructing the graph G using rpForest sets varying weights on edges, which represents the similarity between a pair of samples.Unlike k-nearest neighbor graph where all weights are equal.•Using rpForest graph to initialize GCN provides better results compared to k-nn initialization. The varying weights in rpForest graph quantify the similarity between samples, which guided the GCN training to deliver better results.•The rpForest graph involves the tuning of the hyperparameter (number of trees T). We provided an informative way to set this hyperparameter through spectral analysis.