On computing temporal functions for time-dependent networks using trajectory data streams

Time dependent networks in mobility scenario are key for many applications that need to cope with real world dynamics. However, the quality of a time dependent network relies on the accuracy of its temporal functions. To this aim, we propose a new method for computing temporal functions for a time dependent network using Trajectory Data Streams. This proposal extends the previous Piecewise linear model, which uses a smooth curve approach, called LOESS, that can estimate where the breakpoints values occurs in a Piecewise linear function. A challenge faced by the use of trajectory data streams is related with the time constraint to update time dependent network time functions. Our model computes the time dependent network and update the temporal function that needs to reflect recent data and discard old data. We described our solution and present experimental results, which show that our approach is efficient and effective comparing to their competitors.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  Washington Y. Ochieng,et al.  MAP-MATCHING IN COMPLEX URBAN ROAD NETWORKS , 2009, Revista Brasileira de Cartografia.

[3]  I. Babuska,et al.  Special finite element methods for a class of second order elliptic problems with rough coefficients , 1994 .

[4]  José Maria Monteiro,et al.  Taxi, Please! A Nearest Neighbor Query in Time-Dependent Road Networks , 2016, 2016 17th IEEE International Conference on Mobile Data Management (MDM).

[5]  José Maria Monteiro,et al.  On computing temporal functions for a time-dependent networks using trajectory data , 2016, IDEAS.

[6]  W. Cleveland,et al.  Computational methods for local regression , 1991 .

[7]  Christian S. Jensen,et al.  Efficient and Accurate Path Cost Estimation Using Trajectory Data , 2015, ArXiv.

[8]  Regis Pires Magalhães,et al.  Graphast: an extensible framework for building applications on time-dependent networks , 2015, SIGSPATIAL/GIS.

[9]  H. Akaike A new look at the statistical model identification , 1974 .

[10]  Raymond T. Ng,et al.  Indexing spatio-temporal trajectories with Chebyshev polynomials , 2004, SIGMOD '04.

[11]  Yadong Mu,et al.  Piecewise linear approximation of streaming time series data with max-error guarantees , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[12]  Christian S. Jensen,et al.  Stochastic skyline route planning under time-varying uncertainty , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[13]  Dimitrios Tzovaras,et al.  Managing Spatial Graph Dependencies in Large Volumes of Traffic Data for Travel-Time Prediction , 2016, IEEE Transactions on Intelligent Transportation Systems.

[14]  Yuni Xia,et al.  StreamFitter: A Real Time Linear Regression Analysis System for Continuous Data Streams , 2011, DASFAA.

[15]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[16]  Christos Faloutsos,et al.  Fast Time Sequence Indexing for Arbitrary Lp Norms , 2000, VLDB.

[17]  Adel Javanmard,et al.  Multi-track map matching , 2012, SIGSPATIAL/GIS.

[18]  Simon Washington,et al.  Shortest path and vehicle trajectory aided map-matching for low frequency GPS data , 2015 .

[19]  Javam C. Machado,et al.  Nearest neighbor queries with service time constraints in time-dependent road networks , 2013, MobiGIS '13.

[20]  M. Muggeo,et al.  segmented: An R package to Fit Regression Models with Broken-Line Relationships , 2008 .

[21]  Weiwei Sun,et al.  Quick map matching using multi-core CPUs , 2012, SIGSPATIAL/GIS.

[22]  David G. Mitchell,et al.  Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[23]  W. Marsden I and J , 2012 .

[24]  José Antônio Fernandes de Macêdo,et al.  Aggregate k-nearest neighbors queries in time-dependent road networks , 2012, J. Inf. Data Manag..

[25]  G. Malash,et al.  Piecewise linear regression: A statistical method for the analysis of experimental adsorption data by the intraparticle-diffusion models , 2010 .

[26]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[27]  Renée J. Miller,et al.  Similarity search over time-series data using wavelets , 2002, Proceedings 18th International Conference on Data Engineering.

[28]  Farnoush Banaei Kashani,et al.  Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks , 2010, DEXA.