Predestination: Inferring destinations from partial trajectories

343Citations
Citations of this article
262Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe a method called Predestination that uses a history of a driver's destinations, along with data about driving behaviors, to predict where a driver is going as a trip progresses. Driving behaviors include types of destinations, driving efficiency, and trip times. Beyond considering previously visited destinations, Predestination leverages an open-world modeling methodology that considers the likelihood of users visiting previously unobserved locations based on trends in the data and on the background properties of locations. This allows our algorithm to smoothly transition between "out of the box" with no training data to more fully trained with increasing numbers of observations. Multiple components of the analysis are fused via Bayesian inference to produce a probabilistic map of destinations. Our algorithm was trained and tested on hold-out data drawn from a database of GPS driving data gathered from 169 different subjects who drove 7,335 different trips. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Krumm, J., & Horvitz, E. (2006). Predestination: Inferring destinations from partial trajectories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4206 LNCS, pp. 243–260). Springer Verlag. https://doi.org/10.1007/11853565_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free