Kaiwei Kong, Jian Xu, Ming Xu, Liming Tu, Y. Wu, Zhi Chen
{"title":"基于带有活动的轨迹段的轨迹查询","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":"{\"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}","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}
Trajectory Query Based on Trajectory Segments with Activities
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.