计算包围深度
Computing Enclosing Depth
AI总结:
本文针对此前仅有组合研究的包围深度,首次提出在任意维度下计算查询点相对数据点集包围深度的算法,平面优化达O(n log n),常数维度下保持多项式时间。
摘要:
包围深度是一种新近引入的深度度量,它为文献中研究的许多深度度量提供了下界。到目前为止,包围深度仅从组合角度进行了研究。在这项工作中,我们给出了首批算法,用于计算任意维度下查询点相对于数据点集的包围深度。在平面中,我们能够优化算法以获得O(n log n)的运行时间。在常数维度下,我们的算法仍能在多项式时间内运行。
英文摘要:
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the first algorithms to compute the enclosing depth of a query point with respect to a data point set in any dimension. In the plane we are able to optimize the algorithm to get a runtime of O(n log n). In constant dimension, our algorithms still run in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。