arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.09406cs.CG
收藏

Fréchet距离下时间序列的$(2+ε)$ - ANN

$(2+ε)$-ANN for time series under the Fréchet distance

Anne Driemel, Ioannis Psarros

摘要:

研究了连续Fréchet距离下时间序列的近似近邻数据结构。对于可达到的近似因子$c>1$和查询半径$r$,近似近邻数据结构可以用于预处理$\mathbb{R}$(aka时间序列)中的$n$曲线,每个曲线的复杂度为$m$,以通过返回位于Fréchet距离$cr$内的曲线或回答在距离$r$内的输入中不存在曲线来回答具有复杂度为$k$的曲线的查询。两种情况下,答案都是正确的。我们的第一个数据结构实现了一个$(5+ε)$近似因子,在$n\cdot \mathcal{O}\left({ε^{-1}}\right)^{k} + \mathcal{O}(nm)$中使用空间,在$\mathcal{O}\left(k\right)$中具有查询时间。我们的第二个数据结构实现了$(2+ε)$近似因子,使用$n\cdot \mathcal{O}\left(\frac{m}{kε}\right)^{k} + \mathcal{O}(nm)$中的空间,并在$\mathcal{O}\left(k\cdot 2^k\right)$中具有查询时间。我们的第三个积极的结果是一个概率数据结构的基础上局部敏感的哈希,它实现了空间在$\mathcal{O}(n\log n+nm)$和查询时间在$\mathcal{O}(k\log n)$,并回答查询与近似因子在$\mathcal{O}(k)$。我们所有的数据结构都使用了签名的概念,这最初是为了解决Fréchet距离下的时间序列聚类问题而引入的。此外,我们展示了这个问题的下界。考虑任何一种数据结构,它的近似因子小于$2$,并且支持弧长达到$L$的曲线,并且只使用常量探测器来回答查询。我们表明,在合理的假设下,任何这样的数据结构的字大小需要在$L^{Ω(k)}$空间。

英文摘要:

We study approximate-near-neighbor data structures for time series under the continuous Fréchet distance. For an attainable approximation factor $c>1$ and a query radius $r$, an approximate-near-neighbor data structure can be used to preprocess $n$ curves in $\mathbb{R}$ (aka time series), each of complexity $m$, to answer queries with a curve of complexity $k$ by either returning a curve that lies within Fréchet distance $cr$, or answering that there exists no curve in the input within distance $r$. In both cases, the answer is correct. Our first data structure achieves a $(5+ε)$ approximation factor, uses space in $n\cdot \mathcal{O}\left({ε^{-1}}\right)^{k} + \mathcal{O}(nm)$ and has query time in $\mathcal{O}\left(k\right)$. Our second data structure achieves a $(2+ε)$ approximation factor, uses space in $n\cdot \mathcal{O}\left(\frac{m}{kε}\right)^{k} + \mathcal{O}(nm)$ and has query time in $\mathcal{O}\left(k\cdot 2^k\right)$. Our third positive result is a probabilistic data structure based on locality-sensitive hashing, which achieves space in $\mathcal{O}(n\log n+nm)$ and query time in $\mathcal{O}(k\log n)$, and which answers queries with an approximation factor in $\mathcal{O}(k)$. All of our data structures make use of the concept of signatures, which were originally introduced for the problem of clustering time series under the Fréchet distance. In addition, we show lower bounds for this problem. Consider any data structure which achieves an approximation factor less than $2$ and which supports curves of arclength up to $L$ and answers the query using only a constant number of probes. We show that under reasonable assumptions on the word size any such data structure needs space in $L^{Ω(k)}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑