基于时间窗Frechet和度量的被动轨迹编辑距离
Time Window Frechet and Metric-Based Edit Distance for Passively Collected Trajectories
摘要:
现代定位技术的进步和移动设备的广泛普及为我们提供了收集和挖掘人类移动轨迹的巨大机会。在这项工作中,我们专注于被动收集的轨迹,这是移动实体访问的时间戳位置的序列。为了分析这样的轨迹,一个关键部分是两个轨迹之间的相似性度量。我们提出了时间窗口的弗雷歇距离,它强制执行的两个轨迹,可以在计算中配对的弗雷歇距离,和基于度量的编辑距离,它结合了基本的度量的插入和删除成本的计算点之间的最大时间间隔。使用这些措施,我们可以集群轨迹推断群体运动模式。我们看看$k$收集问题,要求每个集群至少有$k$轨迹。我们证明了在编辑距离、基于度量的编辑距离和Jaccard距离下,k-聚集仍然是NP-难的。最后,我们改进了离散Frechet距离的已有结果,证明了在二维的情形下,不存在逼近因子小于$1.61$的强次二次时间,除非SETH失效.
英文摘要:
The advances of modern localization techniques and the wide spread of mobile devices have provided us great opportunities to collect and mine human mobility trajectories. In this work, we focus on passively collected trajectories, which are sequences of time-stamped locations that mobile entities visit. To analyse such trajectories, a crucial part is a measure of similarity between two trajectories. We propose the time-window Frechet distance, which enforces the maximum temporal separation between points of two trajectories that can be paired in the calculation of the Frechet distance, and the metric-based edit distance which incorporates the underlying metric in the computation of the insertion and deletion costs. Using these measures, we can cluster trajectories to infer group motion patterns. We look at the $k$-gather problem which requires each cluster to have at least $k$ trajectories. We prove that k-gather remains NP-hard under edit distance, metric-based edit distance and Jaccard distance. Finally, we improve over previous results on discrete Frechet distance and show that there is no strongly sub-quadratic time with approximation factor less than $1.61$ in two dimensional setting unless SETH fails.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。