聚类点集近似最近邻搜索分析
Analysis of approximate nearest neighbor searching with clustered point sets
摘要:
我们提出了一个经验分析的数据结构的近似最近邻搜索。我们比较了著名的优化kd-树分裂方法对两种替代的分裂方法。第一种称为滑动中点法,它试图平衡生成有界长宽比的细分单元的目标,同时不生成任何空单元。第二种称为最小模糊度方法,是一种基于查询的方法。除了数据点之外,还给出了一个用于预处理的查询点训练集。它采用了一个简单的贪心算法来选择分裂平面,最大限度地减少了在选择最近的邻居的训练点的平均模糊量。我们提供了一个实证分析,比较这两种方法对优化的kd树的建设,一些综合生成的数据和查询集。我们证明,对于聚类数据和查询集,这些算法可以提供显着的改进,超过标准的kd树结构的近似最近邻搜索。
英文摘要:
We present an empirical analysis of data structures for approximate nearest neighbor searching. We compare the well-known optimized kd-tree splitting method against two alternative splitting methods. The first, called the sliding-midpoint method, which attempts to balance the goals of producing subdivision cells of bounded aspect ratio, while not producing any empty cells. The second, called the minimum-ambiguity method is a query-based approach. In addition to the data points, it is also given a training set of query points for preprocessing. It employs a simple greedy algorithm to select the splitting plane that minimizes the average amount of ambiguity in the choice of the nearest neighbor for the training points. We provide an empirical analysis comparing these two methods against the optimized kd-tree construction for a number of synthetically generated data and query sets. We demonstrate that for clustered data and query sets, these algorithms can provide significant improvements over the standard kd-tree construction for approximate nearest neighbor searching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。