Benchmarking big data for trip recommendation
Kuien Liu, Yaguang Li, Zhiming Ding, Shuo Shang, Kai Zheng · 2014
The availability of massive trajectory data collected from GPS devices has received significant attentions in recent years. A hot topic is trip recommendation, which focuses on searching trajectories that connect (or are close to) a set of query locations, e.g., several sightseeing places specified by a traveller, from a collection of historic trajectories made by other travellers. However, if we know little about the sample coverage of trajectory data when developing an application of trip recommendation, it is difficult for us to answer many practical questions, such as 1) how many (future) queries can be supported with a given set of raw trajectories? 2) how many trajectories are required to achieve a good-enough result? 3) how frequent the update operations need to be performed on trajectory data to keep it long-term effective? In this paper, we focus on studying the overall quality of trajectory data from both spatial and temporal domains and evaluate proposed methods with a real big trajectory dataset. Our results should be useful for both the development of trip recommendation systems and the improvement of trajectory-searching algorithms.