Sciweavers

Share
ICDE
2011
IEEE

Discovering popular routes from trajectories

8 years 3 months ago
Discovering popular routes from trajectories
—The booming industry of location-based services has accumulated a huge collection of users’ location trajectories of driving, cycling, hiking, etc. In this work, we investigate the problem of discovering the Most Popular Route (MPR) between two locations by observing the traveling behaviors of many previous users. This new query is beneficial to travelers who are asking directions or planning a trip in an unfamiliar city/area, as historical traveling experiences can reveal how people usually choose routes between locations. To achieve this goal, we firstly develop a Coherence Expanding algorithm to retrieve a transfer network from raw trajectories, for indicating all the possible movements between locations. After that, the Absorbing Markov Chain model is applied to derive a reasonable transfer probability for each transfer node in the network, which is subsequently used as the popularity indicator in the search phase. Finally, we propose a Maximum Probability Product algorithm ...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou
Added 21 Aug 2011
Updated 21 Aug 2011
Type Journal
Year 2011
Where ICDE
Authors Zaiben Chen, Heng Tao Shen, Xiaofang Zhou
Comments (0)
books