Trip-Mine: An Efficient Trip Planning Approach with Travel Time Constraints

MDM), 2011 12th IEEE International Conference(2011)

引用 81|浏览0
暂无评分
摘要
With the rapid development of wireless telecommunication technologies, a number of studies have been done on the Location-Based Services (LBSs) due to wide applications. Among them, one of the active topics is travel recommendation. Most of previous studies focused on recommendations of attractions or trips based on the user隆娄s location. However, such recommendation results may not satisfy the travel time constraints of users. Besides, the efficiency of trip planning is sensitive to the scalability of travel regions. In this paper, we propose a novel data mining-based approach, namely Trip-Mine, to efficiently find the optimal trip which satisfies the user隆娄s travel time constraint based on the user隆娄s location. Furthermore, we propose three optimization mechanisms based on Trip-Mine to further enhance the mining efficiency and memory storage requirement for optimal trip finding. To the best of our knowledge, this is the first work that takes efficient trip planning and travel time constraints into account simultaneously. Finally, we performed extensive experimental evaluations and show that our proposals deliver excellent results.
更多
查看译文
关键词
optimal trip finding,travel time constraint,travel region,recommendation result,trip planning,travel recommendation,travel time constraints,mining efficiency,time constraint,optimal trip,efficient trip planning,efficient trip planning approach,mobile computing,gold,filtering,optimization,data mining,location based service,dynamic programming,planning,recommender systems,travel industry
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要