A ranking measure for top-k moving object trajectories search

Vikram Goyal, S. Navathe
{"title":"A ranking measure for top-k moving object trajectories search","authors":"Vikram Goyal, S. Navathe","doi":"10.1145/2533888.2533933","DOIUrl":null,"url":null,"abstract":"In this paper we present a new ranking measure for Top-k Trajectory query. A trajectory is defined as a sequence of places with each place having an associated text description with them. A top-k trajectory query consists of a set of locations and a set of activities, and returns a set of relevant trajectories to a user. A trajectory is considered more relevant if it has query activities at places nearby to the query locations. The proposed ranking measure helps to select highly relevant trajectories by capturing the correlation between trajectory places and activities while computing a trajectory relevance score. Previous works on Top-k trajectory query computed a trajectory relevance score either on the basis of spatial proximity or on the basis of combination of spatial proximity and textual similarity in some user defined proportion. These works did not consider association of spatial and textual dimensions, and hence may return trajectories that have query activities at trajectory places very far away from the query locations. In addition to the proposal of a ranking metric, we also give an algorithm to implement the proposed metric efficiently. Finally, we do an experimental study on a real dataset to demonstrate that the proposed ranking measure is indeed effective in terms of retrieval of trajectories that have query activities at places near to the query locations.","PeriodicalId":167948,"journal":{"name":"Workshop on Geographic Information Retrieval","volume":"334 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Geographic Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2533888.2533933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper we present a new ranking measure for Top-k Trajectory query. A trajectory is defined as a sequence of places with each place having an associated text description with them. A top-k trajectory query consists of a set of locations and a set of activities, and returns a set of relevant trajectories to a user. A trajectory is considered more relevant if it has query activities at places nearby to the query locations. The proposed ranking measure helps to select highly relevant trajectories by capturing the correlation between trajectory places and activities while computing a trajectory relevance score. Previous works on Top-k trajectory query computed a trajectory relevance score either on the basis of spatial proximity or on the basis of combination of spatial proximity and textual similarity in some user defined proportion. These works did not consider association of spatial and textual dimensions, and hence may return trajectories that have query activities at trajectory places very far away from the query locations. In addition to the proposal of a ranking metric, we also give an algorithm to implement the proposed metric efficiently. Finally, we do an experimental study on a real dataset to demonstrate that the proposed ranking measure is indeed effective in terms of retrieval of trajectories that have query activities at places near to the query locations.
一种top-k运动目标轨迹搜索的排序方法
本文提出了Top-k轨迹查询的一种新的排序度量。轨迹被定义为一个位置序列,每个位置都有一个相关的文本描述。top-k轨迹查询由一组位置和一组活动组成,并向用户返回一组相关轨迹。如果在查询位置附近的地方有查询活动,则认为轨迹更相关。在计算轨迹相关性分数的同时,所提出的排名方法通过捕获轨迹位置和活动之间的相关性来帮助选择高度相关的轨迹。以往关于Top-k轨迹查询的研究,要么基于空间接近度,要么基于空间接近度和文本相似度在一定用户定义比例下的结合,计算轨迹相关分数。这些工作没有考虑空间和文本维度的关联,因此可能返回的轨迹在离查询位置非常远的轨迹位置有查询活动。除了提出排序指标外,我们还给出了一种有效实现该指标的算法。最后,我们在真实数据集上进行了实验研究,以证明所提出的排序度量在检索在查询位置附近具有查询活动的轨迹方面确实是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信