透過您的圖書館登入
IP:18.188.152.162
  • 學位論文

天際線旅遊路線: 旅遊路線推薦的天際線探勘

Skyline Travel Route: Exploring Skyline for Travel Route Recommendation

指導教授 : 彭文志

摘要


With the advance of location positioning technology and some geo-Web services (e.g., EveryTrail), users can easily use mobile Apps to record their travel experiences via photos and trip trajectories. Prior works have elaborated on trip planning in mining travel routes from a huge number of trajectories. However, most of the travel routes mined may have some overlapping Regions-Of-Interest (ROIs) information, which incur some redundant travel information. Moreover, each ROI may have its appropriate visiting time, and users may also have their own preferred must-see ROIs (referred to as a set of query points). The above two factors are not considered in prior works. Thus, in this paper, given a spatial range $Q$ and a set of query points specified by users, the goal of this paper is to return the travel routes that fulfill two requirements: 1.) travel routes should contain all those query points specified, and 2.) travel routes should be within the spatial range Q. Furthermore, we claim that each query point may have its proper visiting time. As such, the travel routes should go through these query points at their corresponding proper visiting time. To avoid some redundant information in the travel routes, we utilize the skyline concept to retrieve travel routes with more diversity. Specifically, in our paper, we consider some factors, such as the visiting time information of POIs and the set of query points, in retrieving travel routes. These factors could be mapped into dimensional spaces. Then, each travel route is viewed as a data point in the dimensional space. Thus, skyline data points (referred to as skyline travel routes) are returned as the query result. To evaluate our proposed methods, we conducted extensive experiments on real datasets. The experimental results show that skyline travel routes indeed provide more diversity in the query result. In addition, we evaluate the efficiency of retrieving skyline travel routes.

並列摘要


With the advance of location positioning technology and some geo-Web services (e.g., EveryTrail), users can easily use mobile Apps to record their travel experiences via photos and trip trajectories. Prior works have elaborated on trip planning in mining travel routes from a huge number of trajectories. However, most of the travel routes mined may have some overlapping Regions-Of-Interest (ROIs) information, which incur some redundant travel information. Moreover, each ROI may have its appropriate visiting time, and users may also have their own preferred must-see ROIs (referred to as a set of query points). The above two factors are not considered in prior works. Thus, in this paper, given a spatial range $Q$ and a set of query points specified by users, the goal of this paper is to return the travel routes that fulfill two requirements: 1.) travel routes should contain all those query points specified, and 2.) travel routes should be within the spatial range Q. Furthermore, we claim that each query point may have its proper visiting time. As such, the travel routes should go through these query points at their corresponding proper visiting time. To avoid some redundant information in the travel routes, we utilize the skyline concept to retrieve travel routes with more diversity. Specifically, in our paper, we consider some factors, such as the visiting time information of POIs and the set of query points, in retrieving travel routes. These factors could be mapped into dimensional spaces. Then, each travel route is viewed as a data point in the dimensional space. Thus, skyline data points (referred to as skyline travel routes) are returned as the query result. To evaluate our proposed methods, we conducted extensive experiments on real datasets. The experimental results show that skyline travel routes indeed provide more diversity in the query result. In addition, we evaluate the efficiency of retrieving skyline travel routes.

參考文獻


[1] Z. Chen, H. T. Shen, X. Zhou, Y. Zheng, and X. Xie, Searching trajectories by lo cations: an eciency study. in SIGMOD Conference, 2010,
[7] Y. Zheng, L. Zhang, X. Xie, and W.-Y. Ma, Mining interesting locations and travel sequences from gps tra jectories for mobile users, in Proceedings of the 18th International Conference on World Wide Web (WWW) , 2009, pp. 791800.
[8] K. Zheng, S. Shang, N. J. Yuan, Y. Yang, and U. Computing, Towards efficient search for activity trajectories. ICDE, 2013.
[9] X. Cao, G. Cong, and C. S. Jensen, Mining signicant semantic lo cations from gps data, Proceedings of the VLDB Endowment, vol. 3, no.
[11] D. J. Crandall, L. Backstrom, D. Huttenlo cher, and J. Kleinb erg, Mapping the world's photos, in Proceedings of the 18th international conference on World wide web. ACM, 2009, pp. 761770.

被引用紀錄


王采昕(2015)。石化廠作業勞工長期噪音暴露與聽力損失關聯探討〔碩士論文,長榮大學〕。華藝線上圖書館。https://doi.org/10.6833/CJCU.2015.00172

延伸閱讀