Generating time-varying road network data using sparse trajectories
Larriba-Pey, J. L.
IEEE International Conference on Data Mining Workshops, ICDMW, 2016
1118 - 1124
Item Usage Stats
MetadataShow full item record
While research on time-varying graphs has attracted recent attention, the research community has limited or no access to real datasets to develop effective algorithms and systems. Using noisy and sparse GPS traces from vehicles, we develop a time-varying road network data set where edge weights differ over time. We present our methodology and share this dataset, along with a graph manipulation tool. We estimate the traffic conditions using the sparse GPS data available by characterizing the sparsity issues and assessing the properties of travel sequence data frequency domain. We develop interpolation methods to complete the sparse data into a complete graph dataset with realistic time-varying edge values. We evaluate the performance of time-varying and static shortest path solutions over the generated dynamic road network. The shortest paths using the dynamic graph produce very different results than the static version. We provide an independent Java API and a graph database to analyze and manipulate the generated time-varying graph data easily, not requiring any knowledge about the inners of the graph database system. We expect our solution to support researchers to pursue problems of time-varying graphs in terms of theoretical, algorithmic, and systems aspects. The data and Java API are available at: http://elif.eser.bilkent.edu.tr/roadnetwork. © 2016 IEEE.
Dynamic road networks
Time dependent shortest paths
Frequency domain analysis
Real time systems
Roads and streets
Time varying networks
Dynamic road networks
Time-dependent shortest paths
Published Version (Please cite this version)http://dx.doi.org/10.1109/ICDMW.2016.0161
Showing items related by title, author, creator and subject.
Akbudak K.; Aykanat, Cevdet (IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...
Dogrusoz, U. (Elsevier, 2002)We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be ...
Belviranlı, Mehmet Esat (Bilkent University, 2009)Visualization of information is essential for comprehension and analysis of the acquired data in any field of study. Graph layout is an important problem in information visualization and plays a crucial role in the drawing ...