Corpus ID: 232075726

Partitioned Graph Convolution Using Adversarial and Regression Networks for Road Travel Speed Prediction

  title={Partitioned Graph Convolution Using Adversarial and Regression Networks for Road Travel Speed Prediction},
  author={Jakob Meldgaard Kj{\ae}r and Lasse Kristensen and Mads Alberg Christensen},
Access to quality travel time information for roads in a road network has become increasingly important with the rising demand for real-time travel time estimation for paths within road networks. In the context of the Danish road network (DRN) dataset used in this paper, the data coverage is sparse and skewed towards arterial roads, with a coverage of 23.88% across 850,980 road segments, which makes travel time estimation difficult. Existing solutions for graph-based data processing often… Expand

Figures and Tables from this paper


On Network Embedding for Machine Learning on Road Networks: A Case Study on the Danish Road Network
This work analyzes the use of network embedding methods, specifi-cally node2vec, for learning road segment embeddings in road networks and suggests that network embeding methods can indeed be used for deriving relevant network features, but that the qualities of the embeddINGS differ from embeddins for social networks. Expand
Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting
Diffusion Convolutional Recurrent Neural Network (DCRNN), a deep learning framework for traffic forecasting that incorporates both spatial and temporal dependency in the traffic flow and evaluates the framework on two real-world large scale road network traffic datasets and observes consistent improvement. Expand
DeepTravel: a Neural Network Based Travel Time Estimation Model with Auxiliary Supervision
This paper leverage on new development of deep neural networks and propose a novel auxiliary supervision model, namely DeepTravel, that can automatically and effectively extract different features, as well as make full use of the temporal labels of the trajectory data. Expand
Road2Vec: Measuring Traffic Interactions in Urban Road System from Massive Travel Routes
It is argued that the Road2Vec method can be effectively utilized for quantifying complex traffic interactions among roads and capturing underlying heterogeneous and non-linear properties. Expand
Adversarially Regularized Graph Autoencoder
This paper proposes a novel adversarial graph embedding framework for graph data that encodes the topological structure and node content in a graph to a compact representation, on which a decoder is trained to reconstruct the graph structure. Expand
FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
Enhanced with importance sampling, FastGCN not only is efficient for training but also generalizes well for inference, and is orders of magnitude more efficient while predictions remain comparably accurate. Expand
Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks
Cluster-GCN is proposed, a novel GCN algorithm that is suitable for SGD-based training by exploiting the graph clustering structure and allows us to train much deeper GCN without much time and memory overhead, which leads to improved prediction accuracy. Expand
node2vec: Scalable Feature Learning for Networks
In node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks, a flexible notion of a node's network neighborhood is defined and a biased random walk procedure is designed, which efficiently explores diverse neighborhoods. Expand
Stochastic Training of Graph Convolutional Networks with Variance Reduction
Control variate based algorithms which allow sampling an arbitrarily small neighbor size are developed and a new theoretical guarantee for these algorithms to converge to a local optimum of GCN is proved. Expand
Inductive Representation Learning on Large Graphs
GraphSAGE is presented, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data and outperforms strong baselines on three inductive node-classification benchmarks. Expand