TY - GEN
T1 - Discovering personalized routes from trajectories
AU - Chang, Kai Ping
AU - Wei, Ling Yin
AU - Yeh, Mi Yeh
AU - Peng, Wen-Chih
PY - 2011/11/28
Y1 - 2011/11/28
N2 - Most people usually drive their familiar routes to work and are concerned about the traffic on their way to work. If a driver's preferred route is known, the traffic congestion information on his/her way to work will be reported in time. However, the current navigation systems focus on planning the shortest path or the fastest path from a given start point to a given destination point. In this paper, we present a novel personalized route planning framework that considers user movement behaviors. The proposed framework comprises two components, familiar road network construction and route planning. In the first component, we mine familiar road segments from a driver's historical trajectory dataset, and construct a familiar road network. For the second component, we propose an efficient route planning algorithm to generate the top-k familiar routes given a start point and a destination point. We evaluate the performance of our algorithm using a real dataset, and compare our algorithm with an existing approach in terms of effectiveness and efficiency.
AB - Most people usually drive their familiar routes to work and are concerned about the traffic on their way to work. If a driver's preferred route is known, the traffic congestion information on his/her way to work will be reported in time. However, the current navigation systems focus on planning the shortest path or the fastest path from a given start point to a given destination point. In this paper, we present a novel personalized route planning framework that considers user movement behaviors. The proposed framework comprises two components, familiar road network construction and route planning. In the first component, we mine familiar road segments from a driver's historical trajectory dataset, and construct a familiar road network. For the second component, we propose an efficient route planning algorithm to generate the top-k familiar routes given a start point and a destination point. We evaluate the performance of our algorithm using a real dataset, and compare our algorithm with an existing approach in terms of effectiveness and efficiency.
UR - http://www.scopus.com/inward/record.url?scp=81855180828&partnerID=8YFLogxK
U2 - 10.1145/2063212.2063218
DO - 10.1145/2063212.2063218
M3 - Conference contribution
AN - SCOPUS:81855180828
SN - 9781450310338
T3 - 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks, LBSN 2011 - Held in Conjunction with the 19th ACM SIGSPATIAL GIS 2011
BT - 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks, LBSN 2011 - Held in Conjunction with the 19th ACM SIGSPATIAL GIS 2011
T2 - 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks, LBSN 2011 - Held in Conjunction with the 19th ACM SIGSPATIAL GIS 2011
Y2 - 1 November 2011 through 1 November 2011
ER -