Trajectory Query Based on Trajectory Segments with Activities

Kaiwei Kong, Jian Xu, Ming Xu, Liming Tu, Y. Wu, Zhi Chen
{"title":"Trajectory Query Based on Trajectory Segments with Activities","authors":"Kaiwei Kong, Jian Xu, Ming Xu, Liming Tu, Y. Wu, Zhi Chen","doi":"10.1145/3152178.3152180","DOIUrl":null,"url":null,"abstract":"Searching trajectories with activities has attracted much attention in the last decade. Existing studies tend to find trajectories with activities matched to the required keywords. However, returned trajectories may have a satisfying textual matching but are spatially far from query locations. In this paper, differing with traditional work which return entire trajectories without combination, we focus on the intersecting trajectory segments and combine them into a new trajectory. A challenge of this problem is how to find qualified trajectory segments from the large search space and combine them into required trajectories. To this end, we organize trajectories into a hybrid index which enables us to utilize spatial information to prune search space efficiently. In addition, we propose a algorithm to search intersecting trajectory segments and combine them into qualified trajectories according to requirements. The effectiveness of our method is verified by empirical studies based on a real trajectory data set and a synthetic data set.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3152178.3152180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Searching trajectories with activities has attracted much attention in the last decade. Existing studies tend to find trajectories with activities matched to the required keywords. However, returned trajectories may have a satisfying textual matching but are spatially far from query locations. In this paper, differing with traditional work which return entire trajectories without combination, we focus on the intersecting trajectory segments and combine them into a new trajectory. A challenge of this problem is how to find qualified trajectory segments from the large search space and combine them into required trajectories. To this end, we organize trajectories into a hybrid index which enables us to utilize spatial information to prune search space efficiently. In addition, we propose a algorithm to search intersecting trajectory segments and combine them into qualified trajectories according to requirements. The effectiveness of our method is verified by empirical studies based on a real trajectory data set and a synthetic data set.
基于带有活动的轨迹段的轨迹查询
在过去十年中,寻找活动轨迹引起了人们的广泛关注。现有的研究倾向于寻找与所需关键词匹配的活动轨迹。然而,返回的轨迹可能具有令人满意的文本匹配,但在空间上远离查询位置。与传统的不合并返回整个轨迹的方法不同,本文将重点放在交叉轨迹段上,并将它们合并成一个新的轨迹。该问题的一个挑战是如何从庞大的搜索空间中找到合格的轨迹段,并将它们组合成所需的轨迹。为此,我们将轨迹组织成一个混合索引,使我们能够利用空间信息有效地修剪搜索空间。此外,我们还提出了一种搜索相交轨迹段的算法,并根据要求将它们组合成合格的轨迹。基于真实轨迹数据集和合成数据集的实证研究验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信