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

大数据集p-均值曲线的逼近

Approximating The p-Mean Curve of Large Data-Sets

Sepideh Aghamolaei, Mohammad Ghodsi

摘要:

一组分段线性函数,称为折线,$P_1,\ldots,P_L$,每一个都有最多的$n$顶点,可以简化为一个$M$与$k$顶点,使得弗雷歇距离$ε_1,\ldots,ε_L$到这些折线中的每一个在$L_p$距离下最小化。我们将$M$ for $L_p$ with $p\geq 1$称为$p$ -平均曲线($p$ -MC)。我们讨论了$p\geq 1$,其中$L_p$距离满足三角不等式,并且对于大多数$p$值,以前没有讨论过$p$ -mean。对于$L=Ω(1)$和$p$的某些值,计算$p$ -平均值是NP-难的,因此我们讨论近似算法。给出了$L=2$和$p\geq 1$的$O(n^2\log k)$时间精确算法。此外,我们减少了Fréchet距离的离散Fréchet距离增加了一个因素$2$ $k$和$ε$。然后,我们使用我们的精确算法找到一个$3$ -近似$L>2$在$\operatorname{poly}(n,L)$时间。我们的方法是基于一个推广的自由空间图(FSD)的Fréchet距离和可组合的核心集的近似摘要。

英文摘要:

A set of piecewise linear functions, called polylines, $P_1,\ldots,P_L$ each with at most $n$ vertices can be simplified into a polyline $M$ with $k$ vertices, such that the Fréchet distances $ε_1,\ldots,ε_L$ to each of these polylines are minimized under the $L_p$ distance. We call $M$ for $L_p$ with $p\geq 1$ a $p$-mean curve ($p$-MC). We discuss $p\geq 1$, for which $L_p$ distance satisfies the triangle inequality and $p$-mean has not been discussed before for most values $p$. Computing the $p$-mean polyline is NP-hard for $L=Ω(1)$ and some values of $p$, so we discuss approximation algorithms. We give a $O(n^2\log k)$ time exact algorithm for $L=2$ and $p\geq 1$. Also, we reduce the Fréchet distance to the discrete Fréchet distance which adds a factor $2$ to both $k$ and $ε$. Then we use our exact algorithm to find a $3$-approximation for $L>2$ in $\operatorname{poly}(n,L)$ time. Our method is based on a generalization of the free-space diagram (FSD) for Fréchet distance and composable core-sets for approximate summaries.

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

↑