2015/09/17 by Hoang Thanh Lam, Lam, Hoang Thanh, Ernesto Diaz-Aviles +7
Computer Science · Mathematics · #Artificial Intelligence (cs.AI) #Computers and Society (cs.CY) #FOS: Computer and information sciences #I.2.6 #I.5.2 #Machine Learning (cs.LG) #Machine Learning (stat.ML) #cs.AI #cs.CY #cs.LG #stat.ML
paper · pdf · doi:10.48550/arxiv.1509.05257
ECML/PKDD Discovery Challenge 2015
arxiv created 2015/09/17 · arxiv updated 2015/09/30
Real-time estimation of destination and travel time for taxis is of great importance for existing electronic dispatch systems. We present an approach based on trip matching and ensemble learning, in which we leverage the patterns observed in a dataset of roughly 1.7 million taxi journeys to predict the corresponding final destination and travel time for ongoing taxi trips, as a solution for the ECML/PKDD Discovery Challenge 2015 competition. The results of our empirical evaluation show that our approach is effective and very robust, which led our team -- BlueTaxi -- to the 3rd and 7th position of the final rankings for the trip time and destination prediction tasks, respectively. Given the fact that the final rankings were computed using a very small test set (with only 320 trips) we believe that our approach is one of the most robust solutions for the challenge based on the consistency of our good results across the test sets.