通过几何集合覆盖在轨迹数据中发现复杂模式
Finding Complex Patterns in Trajectory Data via Geometric Set Cover
AI总结:
本文将轨迹聚类建模为几何集合覆盖,提出可生成复杂度至多为$l$的多边代表轨迹的近似算法,保持$11Δ$距离保证,并在洋流和全身运动数据上验证有效性。
摘要:
面对GPS数据等大量移动数据时,对轨迹进行聚类是一项核心挑战。我们研究一个可表述为几何集合覆盖问题的聚类问题:给定一条复杂度为$n$的多边形曲线,寻找数量最少的$k$条代表轨迹,每条复杂度至多为$l$,使得输入轨迹上的任意一点都位于输入的某条子轨迹上,而该子轨迹与其中一条代表轨迹的Fréchet距离至多为$Δ$。在此前工作中,Brüning等人(2022)开发了一种双准则近似算法,该算法返回一个大小为$O(kl\log(kl))$的曲线集合,以$11Δ$的半径覆盖输入,时间复杂度为$\widetilde{O}((kl)^2n + kln^3)$,其中$k$是以$Δ$为半径覆盖输入所需的、复杂度为$l$的最少曲线数量。该算法计算出的代表轨迹始终是线段。然而在应用中,人们通常更关注由多条边组成的更复杂的代表曲线。我们提出一种建立在此前工作基础上的新方法,可在$\widetilde{O}(l^2n^4 + kln^4)$时间内计算大小为$O(k\log(n))$的曲线集合,并保持相同的$11Δ$距离保证,其中每条曲线都可由复杂度最高达到给定复杂度参数$l$的曲线组成。我们在洋流追踪数据和全身运动数据上开展实验,结果表明该方法作为分析大型时空数据集的工具是有效的。
英文摘要:
Clustering trajectories is a central challenge when faced with large amounts of movement data such as GPS data. We study a clustering problem that can be stated as a geometric set cover problem: Given a polygonal curve of complexity $n$, find the smallest number $k$ of representative trajectories of complexity at most $l$ such that any point on the input trajectories lies on a subtrajectory of the input that has Fréchet distance at most $Δ$ to one of the representative trajectories. In previous work, Brüning et al.~(2022) developed a bicriteria approximation algorithm that returns a set of curves of size $O(kl\log(kl))$ which covers the input with a radius of $11Δ$ in time $\widetilde{O}((kl)^2n + kln^3)$, where $k$ is the smallest number of curves of complexity $l$ needed to cover the input with a radius of $Δ$. The representative trajectories computed by this algorithm are always line segments. In the applications however, one is usually interested in more complex representative curves which consist of several edges. We present a new approach that builds upon previous work computing a set of curves of size $O(k\log(n))$ in time $\widetilde{O}(l^2n^4 + kln^4)$ with the same distance guarantee of $11Δ$, where each curve may consist of curves of complexity up to the given complexity parameter~$l$. We conduct experiments on tracking data of ocean currents and full body motion data suggesting its validity as a tool for analyzing large spatio-temporal data sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。