ISCAS OpenIR
Benchmarking big data for trip recommendation
Liu, Kuien (1); Li, Yaguang (1); Ding, Zhiming (1); Shang, Shuo (2); Zheng, Kai (3); Liu, Kuien
2014
Conference Name2014 23rd International Conference on Computer Communication and Networks, ICCCN 2014
Conference DateAugust 4, 2014 - August 7, 2014
Conference PlaceShanghai, China
Indexed TypeEI
Publish PlaceInstitute of Electrical and Electronics Engineers Inc.
ISSN10952055
ISBN9781479935727
Department(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Department of Software Engineering, China University of Petroleum, Beijing, China; (3) School of Information Technology and Electrical Engineering, University of Queensland, Brisbane; QLD, Australia
English AbstractThe 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.; 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.
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/16626
Collection中国科学院软件研究所
Corresponding AuthorLiu, Kuien
Recommended Citation
GB/T 7714
Liu, Kuien ,Li, Yaguang ,Ding, Zhiming ,et al. Benchmarking big data for trip recommendation[C]. Institute of Electrical and Electronics Engineers Inc.,2014.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Liu, Kuien (1)]'s Articles
[Li, Yaguang (1)]'s Articles
[Ding, Zhiming (1)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Liu, Kuien (1)]'s Articles
[Li, Yaguang (1)]'s Articles
[Ding, Zhiming (1)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Liu, Kuien (1)]'s Articles
[Li, Yaguang (1)]'s Articles
[Ding, Zhiming (1)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.