Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/20226
Title: Travel time prediction for gps taxi data streams
Authors: Laha, Arnab Kumar
Putatunda, Sayan
Keywords: Data Stream Mining;Incremental Learning;Real-time;Spherical Data Analysis;Stochastic Dominance;Streaming Data
Issue Date: 31-Mar-2017
Publisher: Indian Institute of Management Ahmedabad
Series/Report no.: W.P.;2017-03-03
Abstract: The analysis of data streams offers a great opportunity for development of new methodologies and applications in the area of Intelligent Transportation Systems. In this paper, we propose a new incremental learning approach for the travel time prediction problem for taxi GPS data streams in different scenarios and compare the same with four other existing methods. An extensive performance evaluation using four real life datasets indicate that when the drop-off location is known and the training data sizes are small to moderate the Support Vector Regression method is the best choice considering both prediction accuracy and total computation time. However when the training data size becomes large the Randomized K-Nearest Neighbor Regression with Spherical Distance becomes the method of choice. Even when the drop-off location is unknown then the Support Vector Regression method is the best choice when the training data size is small to moderate while for large training data size the Linear Regression method is a good choice. Finally, when continuous prediction of remaining travel time and continuous updating of total travel time along the trajectory of a trip are considered we find that the Support Vector Regression method has the best predictive accuracy. We also propose a new hybrid method which improves the prediction accuracy of the SVR method in the later part of a trip.
URI: http://hdl.handle.net/11718/20226
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP_2017_03_03.pdfWP_2017_3_31.13 MBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.