计算平面$β$骨架深度
Computing the Planar $β$-skeleton Depth
摘要:
对于$β\geq 1$,查询点$q\in \mathbb{R}^d$相对于$\mathbb{R}^d$上的分布函数$F$的\emph{$β$-skeleton depth}($\SkD_β$)被定义为$q$包含在来自$F$的随机点对的\emph{$β$-skeleton influence region}内的概率。$β$-$q\in \mathbb{R}^d$的骨架深度也可以相对于给定的数据集$S\subseteq \mathbb{R}^d$来定义。在这种情况下,计算$β$ -骨架深度是基于对所有$β$ -骨架影响区域的计数,这些区域是从$S$中包含$q$的点对获得的。$β$ -骨架深度引入了一系列深度函数,其中包含分别用于$β=1$和$β=2$的\emph{spherical depth}和\emph{lens depth}。用于计算$β$ -维度$d$中的骨架深度的直接算法采用$O(dn^2)$。这种计算复杂性是在多变量数据分析中使用$β$ -骨架深度的显著优点,因为与大多数其他数据深度不同,$β$ -骨架深度的时间复杂性在维度$d$中线性增长而不是指数增长。本文的主要结果包括两个算法。第一个是一个最佳的算法,它采用$Θ(n\log n)$来计算平面球面深度,第二个算法的时间复杂度为$O(n^{\frac{3}{2}+ε})$,用于计算平面$β$ -骨架深度,$β>1$。通过减少问题的\textit{Element Uniqueness},我们证明了计算$β$骨架深度需要$Ω(n \log n)$时间。本文还研究了$β$ -骨架深度的一些几何性质.这些性质表明,\emph{simplicial depth}($\SD$)是线性有界的$β$ -骨架深度。本文还得到了不同深度函数的一些实验界。
英文摘要:
For $β\geq 1$, the \emph{$β$-skeleton depth} ($\SkD_β$) of a query point $q\in \mathbb{R}^d$ with respect to a distribution function $F$ on $\mathbb{R}^d$ is defined as the probability that $q$ is contained within the \emph{$β$-skeleton influence region} of a random pair of points from $F$. The $β$-skeleton depth of $q\in \mathbb{R}^d$ can also be defined with respect to a given data set $S\subseteq \mathbb{R}^d$. In this case, computing the $β$-skeleton depth is based on counting all of the $β$-skeleton influence regions, obtained from pairs of points in $S$, that contain $q$. The $β$-skeleton depth introduces a family of depth functions that contains \emph{spherical depth} and \emph{lens depth} for $β=1$ and $β=2$, respectively. The straightforward algorithm for computing the $β$-skeleton depth in dimension $d$ takes $O(dn^2)$. This complexity of computation is a significant advantage of using the $β$-skeleton depth in multivariate data analysis because unlike most other data depths, the time complexity of the $β$-skeleton depth grows linearly rather than exponentially in the dimension $d$. The main results of this paper include two algorithms. The first one is an optimal algorithm that takes $Θ(n\log n)$ for computing the planar spherical depth, and the second algorithm with the time complexity of $O(n^{\frac{3}{2}+ε})$ is for computing the planar $β$-skeleton depth, $β>1$. By reducing the problem of \textit{Element Uniqueness}, we prove that computing the $β$-skeleton depth requires $Ω(n \log n)$ time. Some geometric properties of $β$-skeleton depth are also investigated in this paper. These properties indicate that \emph{simplicial depth} ($\SD$) is linearly bounded by $β$-skeleton depth. Some experimental bounds for different depth functions are also obtained in this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。